On Cotree-Critical and DFS Cotree-Critical Graphs

DOI10.7155/jgaa.00077zbMath1061.05081OpenAlexW2162643463MaRDI QIDQ4679076

Patrice Ossona de Mendez, Hubert de Fraysseix

Publication date: 25 May 2005

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/51251

zbMATH Keywords

algorithmcotree-critical graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (7)

Recent Advances in Exact Crossing Minimization (Extended Abstract) ⋮ Trémaux Trees and Planarity ⋮ Trémaux trees and planarity ⋮ A branch-and-cut approach to the crossing number problem ⋮ Efficient Extraction of Multiple Kuratowski Subdivisions ⋮ Non-planar core reduction of graphs ⋮ PIGALE

This page was built for publication: On Cotree-Critical and DFS Cotree-Critical Graphs