A characterization of DFS cotree critical graphs

DOI10.1007/3-540-45848-4_7MaRDI QIDQ3043707zbMATH OpenFDO

Authors Hubert de Fraysseix, P. Ossona de Mendez

Publication date 6 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2265/22650084.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On Cotree-Critical and DFS Cotree-Critical Graphs
• scientific article; zbMATH DE number 861342
• A constructive characterization of total domination vertex critical graphs
• A note on domatically critical and cocritical graphs
• The characterization of \(p\)-factor-critical graphs
• A characterization of radius-critical graphs
• A generalization of domination critical graphs
• Critical graphs with respect to total domination and connected domination
• A note on \(\Delta\)-critical graphs
• A result on (g,f,n)-critical graphs

Cited in

(5)

• Planarization and fragmentability of some classes of graphs
• Topological Morphing of Planar Graphs
• A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP
• Trémaux trees and planarity
• Trémaux trees and planarity

Describes a project that uses

Uses Software

• PIGALE

This page was built for publication: A characterization of DFS cotree critical graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3043707)