Computational complexity of (2,2) path chromatic number problem

  • Yuan Jinjiang
Article

Abstract

Is there a normalP k coloring usingr colors for a given graph? This problem is called the (k, r) path chromatic number problem of graphs. This paper proves that the (2,2) path chromatic number problem of graphs with maximum degree 4 is NP-complete.

1991 MR Subject Classification

05C15 

Keywords

Graph path chromatic number NP-complete 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Akiyama, J., Era, H., Gervacio, S.V. and Watanable, M., Path chromatic numbers of graphs,J. Graph Theory,13:3 (1989), 569–575.MATHGoogle Scholar
  2. [2]
    YuanJinjiang and Lin Yixun, Some results about path chromatic numbers of graphs,J. Zhengzhou Univ. 21:4 (1992), 1–8.Google Scholar
  3. [3]
    Yuan Jinjiang, NP-Completeness of the path chromatic number problem of graphys,J. Math. Studies (to appear).Google Scholar
  4. [4]
    Gray, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.Google Scholar

Copyright information

© Editorial Committee of Applied Mathematics-A Journal of Chinese Universities 1995

Authors and Affiliations

  • Yuan Jinjiang
    • 1
  1. 1.Department of MathematicsZhengzhou UniversityZhengzhou

Personalised recommendations