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

MaRDI QIDQ3534281zbMATH OpenFDO

Authors Qinglin Roger Yu, Baogang Xu

Publication date 3 November 2008

Full work available at URL https://arxiv.org/abs/math/0609757

zbMATH Keywords

choosabilitydefective coloringlist-colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
• A \((3,1)^*\)-choosable theorem on toroidal graphs
• \((3,2)^{*}\)-choosability of triangle-free toroidal 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

Cited in

(9)

• Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs
• Improper choosability and property B
• ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
• A \((3,1)^*\)-choosable theorem on toroidal graphs
• Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
• 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
• scientific article; zbMATH DE number 7442442 (Why is no real title available?)
• \((3,2)^{*}\)-choosability of triangle-free toroidal graphs

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

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