Linear coloring of graphs

Research output: Contribution to journalArticlepeer-review


A proper vertex coloring of a graph is called linear if the subgraph induced by the vertices colored by any two colors is a set of vertex-disjoint paths. The linear chromatic number of a graph G, denoted by lc(G), is the minimum number of colors in a linear coloring of G. Extending a result of Alon, McDiarmid and Reed concerning acyclic graph colorings, we show that if G has maximum degree d then lc(G) = O(d3/2). We also construct explicit graphs with maximum degree d for which lc(G) = Ω(d3/2), thus showing that the result is optimal, up to an absolute constant factor.

Original languageEnglish
Pages (from-to)293-297
Number of pages5
JournalDiscrete Mathematics
Issue number1-3
StatePublished - Apr 1998

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Linear coloring of graphs'. Together they form a unique fingerprint.

Cite this