Strongly unichord-free graphs

DOI10.7151/DMGT.2080MaRDI QIDQ1717190zbMATH OpenOpenAlexWikidataFDO

Authors Terry A. McKee

Publication date 7 February 2019

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Recommendations

• A new characterization of unichord-free graphs
• Characterizing k-chordal unichord-free graphs
• A characterization of strongly chordal graphs
• Strengthening strongly chordal graphs
• \(\chi\)-bounds, operations, and chords

Cites work

• scientific article; zbMATH DE number 878899 (Why is no real title available?)
• A new characterization of unichord-free graphs
• 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
• Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
• Double-crossed chords and distance-hereditary graphs
• Edge-colouring and total-colouring chordless graphs
• Graph Classes: A Survey
• Independent separator graphs
• Maxclique and unit disk characterizations of strongly chordal graphs
• Minimally 2-connected graphs.
• On Minimal Blocks
• On graphs with no induced subdivision of \(K_4\)
• Total chromatic number of unichord-free graphs

Cited in

(3)

• A new characterization of unichord-free graphs
• \(\chi\)-bounds, operations, and chords
• Characterizing k-chordal unichord-free graphs

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

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