Every toroidal graph without adjacent triangles is (4,1)^*-choosable

DOI10.1016/J.DAM.2006.04.042zbMATH Open1107.05039OpenAlexW2045528288MaRDI QIDQ858302FDOQ858302

Authors: Haihui Zhang, Baogang Xu 

Publication date: 9 January 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.042

Recommendations

• On \((4,1)^*\)-choosability of toroidal graphs without chordal 7-cycles and adjacent 4-cycles
• The 4-choosability of toroidal graphs without intersecting triangles
• A note on \((3,1)^*\)-choosable toroidal graphs
• (3, 1)-choosability of toroidal graphs with some forbidden short cycles
• \((3,2)^{*}\)-choosability of triangle-free toroidal graphs

zbMATH Keywords

choosabilitylinear algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• List Improper Colourings of Planar Graphs
• A note on list improper coloring planar graphs
• Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
• On vertex types and cyclic colourings of 3-connected plane graphs
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• Contractible edges in 3-connected graphs
• On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability
• On structure of some plane graphs with application to choosability
• \((4m,m)\)-choosability of plane graphs

Cited In (15)

• Toroidal graphs without \(K_5^-\) and 6-cycles
• Improper choosability and property B
• The 4-choosability of toroidal graphs without intersecting triangles
• ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
• \((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles
• Acyclic improper choosability of subcubic graphs
• On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
• A \((3,1)^*\)-choosable theorem on toroidal graphs
• A note on list improper coloring of plane graphs
• On \((4,1)^*\)-choosability of toroidal graphs without chordal 7-cycles and adjacent 4-cycles
• (3, 1)-choosability of toroidal graphs with some forbidden short cycles
• A \((3,1)^\ast\)-choosable theorem on planar graphs
• Improper choosability of graphs of nonnegative characteristic
• Title not available (Why is that?)
• \((3,2)^{*}\)-choosability of triangle-free toroidal graphs

This page was built for publication: Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858302)