WHEN ALL MINIMAL VERTEX SEPARATORS INDUCE COMPLETE OR EDGELESS SUBGRAPHS

DOI10.1142/S1793830913500158zbMath1276.05063OpenAlexW2122694710MaRDI QIDQ2864857

Terry A. McKee

Publication date: 26 November 2013

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830913500158

zbMATH Keywords

chordal graphunichord-free graphextreme separator graphindependent separator graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (1)

A new characterization of unichord-free graphs

Cites Work

• Total chromatic number 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: WHEN ALL MINIMAL VERTEX SEPARATORS INDUCE COMPLETE OR EDGELESS SUBGRAPHS