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

DOI10.1007/BF02663898zbMath0837.05056OpenAlexW2329110168MaRDI QIDQ1891685

Jinjiang Yuan

Publication date: 13 May 1996

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02663898

zbMATH Keywords

pathNP-completepath chromatic number problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing ⋮ On monochromatic component size for improper colourings ⋮ Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments ⋮ Minimum \(k\)-path vertex cover

Cites Work

• Unnamed Item
• Path chromatic numbers of graphs

This page was built for publication: Computational complexity of \((2,2)\) path chromatic number problem