Characterizing k-chordal unichord-free graphs
From MaRDI portal
Publication:4577849
Recommendations
- A new characterization of unichord-free graphs
- A Dirac-type characterization of \(k\)-chordal graphs
- On strictly chordality-\(k\) graphs
- Chordal graphs and the characteristic polynomial
- Strongly unichord-free graphs
- A note on uncountable chordal graphs
- A characterization of strongly chordal graphs
- Uncrossed chords of cycles in chordal graphs
- A new characterization of strongly chordal graphs
- Chordal characterization of graphic matroids
Cites work
- A Dirac-type characterization of \(k\)-chordal graphs
- 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
- Dirac-type characterizations of graphs without long chordless cycles
- Distance-hereditary graphs
- Edge-colouring and total-colouring chordless graphs
- Forbidding holes and antiholes
- Graph Classes: A Survey
- Independent separator graphs
- On rigid circuit graphs
- Total chromatic number of unichord-free graphs
Cited in
(7)- A Dirac-type characterization of \(k\)-chordal graphs
- scientific article; zbMATH DE number 2104096 (Why is no real title available?)
- On strictly chordality-\(k\) graphs
- A new characterization of unichord-free graphs
- UNKNOTTING SINGULAR CHARTS WITH NO BLACK VERTICES BY REDUCING NODE-PAIRS
- Strongly unichord-free graphs
- scientific article; zbMATH DE number 437501 (Why is no real title available?)
This page was built for publication: Characterizing k-chordal unichord-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4577849)
