When all minimal vertex separators induce complete or edgeless subgraphs

DOI10.1142/S1793830913500158MaRDI QIDQ2864857zbMATH OpenOpenAlexFDO

Authors 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 graphextreme separator graphindependent separator graphunichord-free graph

Mathematics Subject Classification ID

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

Recommendations

• Requiring that minimal separators induce complete multipartite subgraphs
• When all minimal \(k\)-vertex separators induce complete or edgeless subgraphs
• Graphs with complete minimal k-vertex separators.
• Independent separator graphs
• Some results on connected vertex separators

Cites work

• A structure theorem for graphs with no cycle with a unique chord and its consequences
• Chromatic index of graphs with no cycle with a unique chord
• Graph Classes: A Survey
• Topics in Intersection Graph Theory
• Total chromatic number of unichord-free graphs

Cited in

(5)

• Requiring that minimal separators induce complete multipartite subgraphs
• Graphs with complete minimal k-vertex separators.
• Independent separator graphs
• When all minimal \(k\)-vertex separators induce complete or edgeless subgraphs
• A new characterization of unichord-free graphs

This page was built for publication: When all minimal vertex separators induce complete or edgeless subgraphs

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