Linear coloring of planar graphs without 4-cycles

DOI10.1007/S00373-012-1149-ZzbMath1268.05087OpenAlexW2068900645MaRDI QIDQ354457

Yi Qiao Wang, Wei Fan Wang

Publication date: 19 July 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1149-z

zbMATH Keywords

cycleplanar graphmaximum degreelinear coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Local neighbor-distinguishing index of graphs ⋮ Unnamed Item

Cites Work

• Upper bounds on the linear chromatic number of a graph
• Linear choosability of graphs
• Linear coloring of graphs embeddable in a surface of nonnegative characteristic
• Linear coloring of planar graphs with large girth
• Colouring a graph frugally
• Linear coloring of graphs

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