Every DFS Tree of a 3-connected Graph Contains a Contractible Edge

Elmasry, Amr; Mehlhorn, Kurt; Schmidt, Jens M.

doi:10.1002/jgt.21635

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

Every DFS Tree of a 3-connected Graph Contains a Contractible Edge

MPS-Authors

/persons/resource/persons44380

Elmasry, Amr
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons118275

Schmidt, Jens M.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Elmasry, A., Mehlhorn, K., & Schmidt, J. M. (2013). Every DFS Tree of a 3-connected Graph Contains a Contractible Edge. Journal of Graph Theory, 72(1), 112-121. doi:10.1002/jgt.21635.

引用: https://hdl.handle.net/11858/00-001M-0000-0015-78FA-7

要旨

要旨はありません