n-Tuple Coloring of Planar Graphs with Large Odd Girth

William Klostermeyer, Cun-Quan Zhang. n-Tuple Coloring of Planar Graphs with Large Odd Girth. Graphs and Combinatorics, 18(1):119-132, 2002. [doi]

@article{KlostermeyerZ02,
  title = {n-Tuple Coloring of Planar Graphs with Large Odd Girth},
  author = {William Klostermeyer and Cun-Quan Zhang},
  year = {2002},
  doi = {10.1007/s003730200007},
  url = {http://dx.doi.org/10.1007/s003730200007},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/KlostermeyerZ02},
  cites = {0},
  citedby = {0},
  journal = {Graphs and Combinatorics},
  volume = {18},
  number = {1},
  pages = {119-132},
}