A \((3,1)^*\)-choosable theorem on toroidal graphs
From MaRDI portal
Publication:765376
DOI10.1016/j.dam.2011.10.019zbMath1241.05037OpenAlexW2061202225MaRDI QIDQ765376
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.10.019
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
\((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles ⋮ Similar construction method of solution for solving the mathematical model of fractal reservoir with spherical flow ⋮ A \((3,1)^\ast\)-choosable theorem on planar graphs ⋮ Acyclic improper choosability of subcubic graphs ⋮ On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
Cites Work
- Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
- A note on list improper coloring of plane graphs
- Improper choosability of graphs of nonnegative characteristic
- Choosability of toroidal graphs without short cycles
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- List Improper Colourings of Planar Graphs
- A note on list improper coloring planar graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: A \((3,1)^*\)-choosable theorem on toroidal graphs
