On Cotree-Critical and DFS Cotree-Critical Graphs

Authors

  • Hubert de Fraysseix
  • Patrice Ossona de Mendez

DOI:

https://doi.org/10.7155/jgaa.00077

Abstract

We give a characterization of DFS cotree-critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE (Public Implementation of a Graph Algorithm Library and Editor []) by the authors, and deduce a justification of a very simple algorithm for finding a Kuratowski subdivision in a DFS cotree-critical graph.

Downloads

Download data is not yet available.

Downloads

Published

2003-01-01

How to Cite

de Fraysseix, H., & Ossona de Mendez, P. (2003). On Cotree-Critical and DFS Cotree-Critical Graphs. Journal of Graph Algorithms and Applications, 7(4), 411–427. https://doi.org/10.7155/jgaa.00077

Issue

Vol. 7 No. 4 (2003): Advances in Graph Drawing. Special Issue on Selected Papers from the Ninth International Symposium on Graph Drawing, GD 2001

Section

Articles

Categories

License

Copyright (c) 2003 Hubert de Fraysseix, Patrice Ossona de Mendez

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.