Edge choosablity and total choosability of toroidal graphs without intersecting triangles.

MaRDI QIDQ4897470zbMATH OpenFDO

Authors Rui Li, Baogang Xu

Publication date 19 December 2012

zbMATH Keywords

list edge coloringtoroidal graphdischarging methodlist total coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• The 4-choosability of toroidal graphs without intersecting triangles
• Total colorings and list total colorings of planar graphs without intersecting 4-cycles
• Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
• \((3,2)^{*}\)-choosability of triangle-free toroidal graphs

Cited in

(5)

• Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
• The 4-choosability of toroidal graphs without intersecting triangles
• ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
• A \((3,1)^*\)-choosable theorem on toroidal graphs
• scientific article; zbMATH DE number 7442442 (Why is no real title available?)

This page was built for publication: Edge choosablity and total choosability of toroidal graphs without intersecting triangles.

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