English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

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 Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

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.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0015-78FA-7
Abstract
There is no abstract available