English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

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

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.

Item is

Basic

show hide
Genre: Journal Article
Latex : Every {DFS} Tree of a 3-connected Graph Contains a Contractible Edge
Other : Every DFS-Tree of a 3-connected Graph Contains a Contractible Edge

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Elmasry, Amr1, Author           
Mehlhorn, Kurt1, Author           
Schmidt, Jens M.1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2012-032013
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1002/jgt.21635
BibTex Citekey: Elmasry2013
Other: Local-ID: 4FE50A6D333665B3C1257AC200498D2D-Elmasry2013
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Journal of Graph Theory
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: New York : John Wiley & Sons.
Pages: - Volume / Issue: 72 (1) Sequence Number: - Start / End Page: 112 - 121 Identifier: ISSN: 0364-9024
CoNE: https://pure.mpg.de/cone/journals/resource/954925523750