Some Conjectures and Questions in Chromatic Topological Graph Theory
From MaRDI portal
Publication:5506783
DOI10.1007/978-3-319-31940-7_12zbMath1355.05110OpenAlexW2532678746MaRDI QIDQ5506783
Publication date: 16 December 2016
Published in: Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-31940-7_12
planar graphschromatic numberHadwiger's conjecturelist coloringgraph thicknesslocally planar graphgreat-circle graph
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List colourings of planar graphs
- Five-coloring graphs on the Klein bottle
- Hamiltonicity and colorings of arrangement graphs
- Locally planar graphs are 5-choosable
- Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
- Hadwiger's conjecture is true for almost every graph
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Five-coloring maps on surfaces
- Every planar graph is 5-choosable
- Spanning quadrangulations of triangulated surfaces
- Colouring Eulerian triangulations
- Coloring locally bipartite graphs on surfaces.
- Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces
- Extending precolorings of subgraphs of locally planar graphs
- Three-coloring graphs embedded on surfaces with all faces even-sided
- Beautiful conjectures in graph theory
- List Colorings of K5-Minor-Free Graphs With Special List Assignments
- Short Proof of a Map-Colour Theorem
- On list-coloring outerplanar graphs
- Mathematica in Action
- Locally Planar Toroidal Graphs are 5-Colorable
- Every planar map is four colorable
- A Six Color Problem
- Topics in Chromatic Graph Theory
- 6-Critical Graphs on the Klein Bottle
- Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM