Connected cutsets of a graph and triangle bases of the cycle space

DOI10.1016/0012-365X(86)90115-9zbMath0609.05032MaRDI QIDQ1086578

Pierre Duchet, Michel Las Vergnas, Henri Meyniel

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cutsetsimplicial decompositionconnected planar graphcontraction dismantleable graphsdisc triangulationsWell- connected graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items

Pseudo-modular graphs, Connected cutsets of a graph and triangle bases of the cycle space, On the null-homotopy of graphs, On the null-homotopy of bridged graphs, Simplicial decompositions of graphs: A survey of applications, Homology of the line graph and of related graph-valued functions, On inverse problems for the cycle graph operator, Convergence of iterated clique graphs, To Approximate Treewidth, Use Treelength!, Finding cut-vertices in the square roots of a graph, Classification of robust cycle bases and relations to fundamental cycle bases, Graphical splittings of Artin kernels, Decomposition and \(l_1\)-embedding of weakly median graphs

Cites Work

• Unnamed Item
• Bemerkungen zu Hadwigers Vermutung
• On the maximum density of graphs which have no subcontraction to \(K^ r\).
• Connected cutsets of a graph and triangle bases of the cycle space
• A Quick Proof of Wagner's Equivalence Theorem
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs