3-coloring and 3-clique-ordering of Locally Connected Graphs:

@article{Kochol20053coloringA3,
  title={3-coloring and 3-clique-ordering of Locally Connected Graphs:},
  author={Martin Kochol},
  journal={J. Algorithms},
  year={2005},
  volume={54},
  pages={122-125}
}
We present a linear algorithm for 3-coloring of locally connected graphs.  2004 Elsevier Inc. All rights reserved. 

From This Paper

Topics from this paper.
2 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Coloring of locally-connected gra phs

  • I. Zverovich
  • RUTCOR Research Report 32-2002,
  • 2002
2 Excerpts

Fast exact coloring algorithms

  • I. Schiermeyer
  • Tatra Mt. Math. Publ
  • 1996
2 Excerpts

Onthe NP - completeness of the k - colorability problem for triangle - free graphs

  • M. Preissmann Maffray
  • Discrete Math .
  • 1996

Similar Papers

Loading similar papers…