Some Conjectures and Questions in Chromatic Topological Graph Theory
DOI10.1007/978-3-319-31940-7_12zbMATH Open1355.05110OpenAlexW2532678746MaRDI QIDQ5506783FDOQ5506783
Authors: Joan P. Hutchinson 
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
Recommendations
- On topological relaxations of chromatic conjectures
- Topics in Chromatic Graph Theory
- scientific article; zbMATH DE number 3308988
- Some topological methods in graph coloring theory
- scientific article; zbMATH DE number 3251276
- On certain chromatic topological indices of some Mycielski graphs
- scientific article; zbMATH DE number 773170
- scientific article; zbMATH DE number 4108788
- Topology of Hom complexes and test graphs for bounding chromatic number
- scientific article; zbMATH DE number 742642
chromatic numberHadwiger's conjecturelist coloringplanar graphsgraph 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)
Cites Work
- Title not available (Why is that?)
- Hadwiger's conjecture is true for almost every graph
- Graphs on surfaces
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Five-coloring maps on surfaces
- Every planar graph is 5-choosable
- Every planar map is four colorable
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal proof - the four color theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- 6-Critical Graphs on the Klein Bottle
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Five-coloring graphs on the Klein bottle
- Mathematica in action. Problem solving through visualization and computation. With CD-ROM.
- Title not available (Why is that?)
- List colourings of planar graphs
- Three-coloring graphs embedded on surfaces with all faces even-sided
- Title not available (Why is that?)
- Locally planar graphs are 5-choosable
- Title not available (Why is that?)
- A Six Color Problem
- Hamiltonicity and colorings of arrangement graphs
- A characterization of uniquely 2-list colorable graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Colouring Eulerian triangulations
- Beautiful conjectures in graph theory
- Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
- Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs
- Extending precolorings of subgraphs of locally planar graphs
- Coloring locally bipartite graphs on surfaces.
- Locally Planar Toroidal Graphs are 5-Colorable
- Short Proof of a Map-Colour Theorem
- Topics in Chromatic Graph Theory
- On list-coloring outerplanar graphs
- Spanning quadrangulations of triangulated surfaces
- List colorings of \(K_5\)-minor-free graphs with special list assignments
- Title not available (Why is that?)
- Coloring of locally planar graphs with one color class small
Cited In (4)
Uses Software
This page was built for publication: Some Conjectures and Questions in Chromatic Topological Graph Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5506783)
