A (3,1)^*-choosable theorem on toroidal graphs

DOI10.1016/J.DAM.2011.10.019MaRDI QIDQ765376zbMATH OpenOpenAlexFDO

Authors Li Zhang

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

zbMATH Keywords

cycletoroidal graphimproper choosability

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
• A note on \((3,1)^*\)-choosable toroidal graphs
• \((3,2)^{*}\)-choosability of triangle-free toroidal graphs
• (3, 1)-choosability of toroidal graphs with some forbidden short cycles
• scientific article; zbMATH DE number 7442442
• A \((3,1)^\ast\)-choosable theorem on planar graphs
• scientific article; zbMATH DE number 6172651
• Edge choosablity and total choosability of toroidal graphs without intersecting triangles.
• Choosability of toroidal graphs without short cycles
• A note on strong edge choosability of toroidal subcubic graphs

Cites work

• scientific article; zbMATH DE number 1250667 (Why is no real title available?)
• A note on \((3,1)^*\)-choosable toroidal graphs
• A note on list improper coloring of plane graphs
• A note on list improper coloring planar graphs
• Choosability of toroidal graphs without short cycles
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
• Improper choosability of graphs of nonnegative characteristic
• List Improper Colourings of Planar Graphs

Cited in

(10)

• scientific article; zbMATH DE number 7442442 (Why is no real title available?)
• \((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles
• A note on \((3,1)^*\)-choosable toroidal graphs
• Similar construction method of solution for solving the mathematical model of fractal reservoir with spherical flow
• On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
• \((3,2)^{*}\)-choosability of triangle-free toroidal graphs
• A \((3,1)^\ast\)-choosable theorem on planar graphs
• ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
• On \((4,1)^*\)-choosability of toroidal graphs without chordal 7-cycles and adjacent 4-cycles
• Acyclic improper choosability of subcubic graphs

This page was built for publication: A \((3,1)^*\)-choosable theorem on toroidal graphs

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