Choosability of toroidal graphs without short cycles
From MaRDI portal
Recommendations
- (3, 1)-choosability of toroidal graphs with some forbidden short cycles
- Toroidal graphs containing neither \(K_5^-\) nor 6-cycles are 4-choosable
- On \((4,1)^*\)-choosability of toroidal graphs without chordal 7-cycles and adjacent 4-cycles
- scientific article; zbMATH DE number 6007732
- ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
Cites work
- 3-list-coloring planar graphs of girth 5
- A 4-Color Theorem for Toroidal Graphs
- A not 3-choosable planar graph without 3-cycles
- Choosability and edge choosability of planar graphs without five cycles
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
- Chromatic numbers of quadrangulations on closed surfaces
- Color-critical graphs on a fixed surface
- Colorings and orientations of graphs
- Every planar graph is 5-choosable
- Five-coloring graphs on the torus
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- List colourings of planar graphs
- Map-Colour Theorems
- On structure of some plane graphs with application to choosability
- Planar Graphs without 7-Cycles Are 4-Choosable
- Planar graphs without cycles of specific lengths
- Some counterexamples associated with the three-color problem
- The 4-choosability of planar graphs without 6-cycles
- The 4-choosability of plane graphs without 4-cycles
- The colour theorems of Brooks and Gallai extended
- Three-coloring graphs embedded on surfaces with all faces even-sided
Cited in
(14)- A new sufficient condition for a toroidal graph to be 4-choosable
- Entire coloring of graphs embedded in a surface of nonnegative characteristic
- (3, 1)-choosability of toroidal graphs with some forbidden short cycles
- scientific article; zbMATH DE number 6007732 (Why is no real title available?)
- ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
- Toroidal graphs containing neither \(K_5^-\) nor 6-cycles are 4-choosable
- 5-list coloring toroidal 6-regular triangulations in linear time
- Variable degeneracy on toroidal graphs
- The Alon-Tarsi number of a toroidal grid
- Toroidal graphs without K₅^- and 6-cycles
- 5-list coloring toroidal 6-regular triangulations in linear time
- Degeneracy of toroidal graphs without special cycles
- A \((3,1)^*\)-choosable theorem on toroidal graphs
- The 4-choosability of toroidal graphs without intersecting triangles
This page was built for publication: Choosability of toroidal graphs without short cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055923)
