Requiring that minimal separators induce complete multipartite subgraphs

DOI10.7151/DMGT.1988zbMath1377.05124OpenAlexW2624079913MaRDI QIDQ1692647

Terry A. McKee

Publication date: 10 January 2018

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

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

zbMATH Keywords

chordal graphcomplete multipartite graphminimal 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) Graph representations (geometric and intersection representations, etc.) (05C62)

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
• Chromatic index of graphs with no cycle with a unique chord
• 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: Requiring that minimal separators induce complete multipartite subgraphs