Characterizing atoms that result from decomposition by clique separators

DOI10.7151/dmgt.1944zbMath1366.05088OpenAlexW2565498663MaRDI QIDQ2364081

Terry A. McKee

Publication date: 17 July 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1944

zbMATH Keywords

minimal separatorclique separatorunichord-free graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
• A new characterization of unichord-free graphs
• Decomposition by clique separators
• Treewidth. Computations and approximations
• An introduction to clique minimal separator decomposition
• Optimal decomposition by clique separators
• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• A structure theorem for graphs with no cycle with a unique chord and its consequences

This page was built for publication: Characterizing atoms that result from decomposition by clique separators