New graph classes characterized by weak vertex separators and two-pairs
From MaRDI portal
Publication:2409764
DOI10.1016/j.akcej.2016.11.008zbMath1372.05060OpenAlexW2557477110MaRDI QIDQ2409764
Publication date: 13 October 2017
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2016.11.008
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
- Total chromatic number of unichord-free graphs
- Weakly triangulated graphs
- A new characterization of unichord-free graphs
- Distance-hereditary graphs
- Treewidth. Computations and approximations
- Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]
- Chromatic index of graphs with no cycle with a unique chord
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- A structure theorem for graphs with no cycle with a unique chord and its consequences