The result on (3,1)^ -choosability of graphs of nonnegative characteristic without 4-cycles and intersecting triangles.

MaRDI QIDQ2822835zbMATH OpenFDO

Authors Haihui Zhang

Publication date 5 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

graphcharacteristicdefective choosabilityintersecting cycles

Mathematics Subject Classification ID

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

Recommendations

• (3, 1)^*-choosability of graphs of nonnegative characteristic without intersecting short cycles
• scientific article; zbMATH DE number 6873968
• Improper choosability of graphs of nonnegative characteristic
• List improper coloring of graphs of nonnegative characteristic
• A \((3,1)^\ast\)-choosable theorem on planar graphs

Cited in

(3)

• (3, 1)^*-choosability of graphs of nonnegative characteristic without intersecting short cycles
• List improper coloring of graphs of nonnegative characteristic
• Improper choosability of graphs of nonnegative characteristic

This page was built for publication: The result on \((3,1)^\ast \)-choosability of graphs of nonnegative characteristic without 4-cycles and intersecting triangles.

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