\((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles

DOI10.1007/s12044-016-0272-9zbMath1338.05096OpenAlexW2307003915MaRDI QIDQ282304

Haihui Zhang

Publication date: 12 May 2016

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12044-016-0272-9

zbMATH Keywords

graphcharacteristicdefective choosabilityintersecting cycles

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
• A \((3,1)^*\)-choosable theorem on toroidal graphs
• Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
• Planar graphs are 1-relaxed, 4-choosable
• A note on list improper coloring of plane graphs
• List improper colorings of planar graphs with prescribed girth
• Improper choosability of graphs of nonnegative characteristic
• List Set Colouring: Bounds and Algorithms
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• List Improper Colourings of Planar Graphs
• A Grötzsch-Type Theorem for List Colourings with Impropriety One
• Improper Choosability of Planar Graphs without 4-Cycles
• A note on list improper coloring planar graphs

This page was built for publication: \((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles