Choosability of toroidal graphs without short cycles
From MaRDI portal
Publication:3055923
DOI10.1002/jgt.20460zbMath1205.05083MaRDI QIDQ3055923
Xuding Zhu, Leizhen Cai, Wei Fan Wang
Publication date: 10 November 2010
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20460
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
A \((3,1)^*\)-choosable theorem on toroidal graphs, The 4-choosability of toroidal graphs without intersecting triangles
Cites Work
- Unnamed Item
- List colourings of planar graphs
- Planar graphs without cycles of specific lengths
- Some counterexamples associated with the three-color problem
- Colorings and orientations of graphs
- The 4-choosability of plane graphs without 4-cycles
- Five-coloring graphs on the torus
- Every planar graph is 5-choosable
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- The colour theorems of Brooks and Gallai extended
- Color-critical graphs on a fixed surface
- Choosability and edge choosability of planar graphs without five cycles
- On structure of some plane graphs with application to choosability
- 3-list-coloring planar graphs of girth 5
- Three-coloring graphs embedded on surfaces with all faces even-sided
- A not 3-choosable planar graph without 3-cycles
- Chromatic numbers of quadrangulations on closed surfaces
- Planar Graphs without 7-Cycles Are 4-Choosable
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
- A 4-Color Theorem for Toroidal Graphs
- Map-Colour Theorems
