Linear coloring of planar graphs without 3-cycles

MaRDI QIDQ3109507zbMATH OpenFDO

Authors Kan Wang

Publication date 27 January 2012

zbMATH Keywords

cyclelinear coloringmaximum degreeplanar graphs

Mathematics Subject Classification ID

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

Recommendations

• Linear coloring of planar graphs without 4-cycles
• A result on linear coloring of planar graphs
• An upper bound of linear chromatic number of planar graphs
• Linear coloring of planar graphs with large girth
• New upper bounds on linear coloring of planar graphs

Cited in

(2)

• Linear coloring of planar graphs without 4-cycles
• Linear coloring of graphs without 4-cycles and embeddable in a surface of nonnegative Euler characteristic

This page was built for publication: Linear coloring of planar graphs without 3-cycles

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