Improper choosability of graphs of nonnegative characteristic

DOI10.1016/j.camwa.2008.03.036zbMath1165.05342OpenAlexW2052758001MaRDI QIDQ2389752

Yongzhu Chen, Weiyi Zhu, Wei Fan Wang

Publication date: 18 July 2009

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2008.03.036

zbMATH Keywords

graphcyclechordcharacteristicimproper choosability

Mathematics Subject Classification ID

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

Related Items (4)

\((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles ⋮ Improper Choosability and Property B ⋮ Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs ⋮ A \((3,1)^*\)-choosable theorem on toroidal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
• List improper colorings of planar graphs with prescribed girth
• A survey of hereditary properties of graphs
• List Improper Colourings of Planar Graphs
• Dirac's map-color theorem for choosability
• Generalized list colourings of graphs
• A Grötzsch-Type Theorem for List Colourings with Impropriety One
• A note on list improper coloring planar graphs

This page was built for publication: Improper choosability of graphs of nonnegative characteristic