ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
From MaRDI portal
Publication:3397518
DOI10.1142/S1793830909000233zbMath1201.05035OpenAlexW2148122311MaRDI QIDQ3397518
Publication date: 22 September 2009
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830909000233
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs, (3, 1)-choosability of toroidal graphs with some forbidden short cycles
Cites Work
- Unnamed Item
- Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
- A note on list improper coloring of plane graphs
- 3-list-coloring planar graphs of girth 5
- List improper colorings of planar graphs with prescribed girth
- List Improper Colourings of Planar Graphs
- A Grötzsch-Type Theorem for List Colourings with Impropriety One
- On $(3,1)^*$-Coloring of Plane Graphs
- A note on list improper coloring planar graphs