Skip to main content
Log in

Linear Coloring of Planar Graphs Without 4-Cycles

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A proper vertex coloring of a graph G is linear if the graph induced by the vertices of any two color classes is the union of vertex-disjoint paths. The linear chromatic number lc(G) of G is the smallest number of colors in a linear coloring of G. In this paper, we prove that if G is a planar graph without 4-cycles, then lc\({(G)\le \lceil \frac {\Delta}2\rceil+8}\) , where Δ denotes the maximum degree of G.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Esperet L., Montassier M., Raspaud A.: Linear choosability of graphs. Discrete Math. 308, 3938–3950 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hind H., Molloy M., Reed B.: Colouring a graph frugally. Combinatorica 17, 469–482 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Li C., Wang W., Raspaud A.: Upper bounds on the linear chromatic number of a graph. Discrete Math. 311, 232–238 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Raspaud A., Wang W.: Linear coloring of planar graphs with large girth. Discrete Math. 309, 5678–5686 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Wang W., Li C.: Linear coloring of graphs embeddable in a surface of nonnegative characteristic. Sci. China Ser. A 52, 991–1003 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Yuster R.: Linear coloring of graphs. Discrete Math. 185, 293–297 (1998)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Weifan Wang.

Additional information

Research supported partially by NSFC (No. 11071223, No. 61170302), ZJNSF (No. Z6090150), ZSDZZZZXK08 and IP-OCNS-ZJNU.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, W., Wang, Y. Linear Coloring of Planar Graphs Without 4-Cycles. Graphs and Combinatorics 29, 1113–1124 (2013). https://doi.org/10.1007/s00373-012-1149-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-012-1149-z

Keywords

Navigation