New graph classes characterized by weak vertex separators and two-pairs
From MaRDI portal
Publication:2409764
Recommendations
Cites work
- scientific article; zbMATH DE number 22656 (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
- Distance-hereditary graphs
- Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]
- Graph Classes: A Survey
- Independent separator graphs
- Minimal weak separators of chordal graphs.
- Topics in Intersection Graph Theory
- Total chromatic number of unichord-free graphs
- Treewidth. Computations and approximations
- Weakly triangulated graphs
Cited in
(2)
This page was built for publication: New graph classes characterized by weak vertex separators and two-pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409764)