Star coloring bipartite planar graphs

Henry Kierstead, André Kündgen, Craig Timmons

Research output: Contribution to journalArticlepeer-review

20 Scopus citations


A star coloring of a graph is a proper vertex-coloring such that no path on four vertices is 2-colored. We prove that the vertices of every bipartite planar graph can be star colored from lists of size 14, and we give an example of a bipartite planar graph that requires at least eight colors to star color.

Original languageEnglish (US)
Pages (from-to)1-10
Number of pages10
JournalJournal of Graph Theory
Issue number1
StatePublished - Jan 2009


  • Planar graphs
  • Star coloring

ASJC Scopus subject areas

  • Geometry and Topology


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

Cite this