Improper choosability of graphs of nonnegative characteristic

DOI10.1016/J.CAMWA.2008.03.036MaRDI QIDQ2389752zbMATH OpenOpenAlexFDO

Authors Yongzhu Chen, Weiyi Zhu, Weifan 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

graphcyclecharacteristicimproper choosabilitychord

Mathematics Subject Classification ID

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

Recommendations

• List improper coloring of graphs of nonnegative characteristic
• (3, 1)^*-choosability of graphs of nonnegative characteristic without intersecting short cycles
• The result on \((3,1)^\ast \)-choosability of graphs of nonnegative characteristic without 4-cycles and intersecting triangles.
• Improper choosability of planar graphs without 6-circuits
• Improper choosability of graphs embedded on the surface of genus r

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 1250667 (Why is no real title available?)
• A Grötzsch-Type Theorem for List Colourings with Impropriety One
• A note on list improper coloring planar graphs
• A survey of hereditary properties of graphs
• Dirac's map-color theorem for choosability
• Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
• Generalized list colourings of graphs
• List Improper Colourings of Planar Graphs
• List improper colorings of planar graphs with prescribed girth
• Multicriterial graph problems with MAXMIN criterion

Cited in

(10)

• Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs
• Improper choosability of graphs embedded on the surface of genus r
• Improper choosability and property B
• (3, 1)^*-choosability of graphs of nonnegative characteristic without intersecting short cycles
• A \((3,1)^*\)-choosable theorem on toroidal graphs
• On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability
• Defective choosability of graphs in surfaces
• List improper coloring of graphs of nonnegative characteristic
• The result on \((3,1)^\ast \)-choosability of graphs of nonnegative characteristic without 4-cycles and intersecting triangles.
• On improperly chromatic-choosable graphs

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

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