Strongly unichord-free graphs

DOI10.7151/dmgt.2080zbMath1404.05097OpenAlexW2800578951WikidataQ129912869 ScholiaQ129912869MaRDI QIDQ1717190

Terry A. McKee

Publication date: 7 February 2019

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

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

zbMATH Keywords

strongly chordal graphminimally 2-connected graphunichord-free graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Cites Work

• Edge-colouring and total-colouring chordless graphs
• On graphs with no induced subdivision of \(K_4\)
• Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
• Total chromatic number of unichord-free graphs
• A new characterization of unichord-free graphs
• Chromatic index of graphs with no cycle with a unique chord
• Maxclique and unit disk characterizations of strongly chordal graphs
• Graph Classes: A Survey
• A structure theorem for graphs with no cycle with a unique chord and its consequences
• Minimally 2-connected graphs.
• On Minimal Blocks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strongly unichord-free graphs