Characterizing k-chordal unichord-free graphs

DOI10.1142/S179383091850043XzbMath1393.05221OpenAlexW2794823853MaRDI QIDQ4577849

Terry A. McKee

Publication date: 3 August 2018

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

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

zbMATH Keywords

minimal separatorunichord-free graph\(k\)-chordal graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• Edge-colouring and total-colouring chordless graphs
• A Dirac-type characterization of \(k\)-chordal graphs
• Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
• Total chromatic number of unichord-free graphs
• On rigid circuit graphs
• A new characterization of unichord-free graphs
• Distance-hereditary graphs
• Dirac-type characterizations of graphs without long chordless cycles
• Chromatic index of graphs with no cycle with a unique chord
• Graph Classes: A Survey
• A structure theorem for graphs with no cycle with a unique chord and its consequences