Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
From MaRDI portal
Publication:1043806
DOI10.1007/s00373-008-0833-5zbMath1223.05195OpenAlexW1979858320MaRDI QIDQ1043806
Publication date: 9 December 2009
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-008-0833-5
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (5)
On betweenness-uniform graphs ⋮ The thickness and chromatic number of \(r\)-inflated graphs ⋮ Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs ⋮ Defective and clustered choosability of sparse graphs ⋮ Some Conjectures and Questions in Chromatic Topological Graph Theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some simplified NP-complete graph problems
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- E 11 and M theory
- 4-critical 4-valent planar graphs constructed with crowns.
- Determining the thickness of graphs is NP-hard
- [https://portal.mardi4nfdi.de/wiki/Publication:4256105 Haj�s constructions of critical graphs]
- Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon
- Graphs, Algorithms, and Optimization
- Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs
- The Non-Biplanar Character of the Complete 9-Graph
- Every planar graph with nine points has a nonplanar complement
This page was built for publication: Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
