The 4-choosability of toroidal graphs without intersecting triangles

DOI10.1016/J.IPL.2006.11.005zbMATH Open1185.05069OpenAlexW2090375754MaRDI QIDQ845970FDOQ845970

Authors: Luo Xiaofang 

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.11.005

Recommendations

• Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• (3, 1)-choosability of toroidal graphs with some forbidden short cycles
• On \((4,1)^*\)-choosability of toroidal graphs without chordal 7-cycles and adjacent 4-cycles
• Edge choosablity and total choosability of toroidal graphs without intersecting triangles.

zbMATH Keywords

list coloringchoosabilitycyclecombinatorial problemstoroidal graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Every planar graph is 5-choosable
• Multicriterial graph problems with MAXMIN criterion
• List colourings of planar graphs
• Dirac's map-color theorem for choosability
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• Choosability of toroidal graphs without short cycles

Cited In (8)

• Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
• DP-4-coloring of planar graphs with some restrictions on cycles
• Entire coloring of graphs embedded in a surface of nonnegative characteristic
• A new sufficient condition for a toroidal graph to be 4-choosable
• Toroidal graphs containing neither \(K_5^-\) nor 6-cycles are 4-choosable
• Cover and variable degeneracy
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• Edge choosablity and total choosability of toroidal graphs without intersecting triangles.

This page was built for publication: The 4-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 Q845970)