Detour Chromatic Numbers
From MaRDI portal
Publication:4542874
DOI10.7151/dmgt.1150zbMath1002.05021OpenAlexW2083401018MaRDI QIDQ4542874
Marietjie Frick, Frank Bullock
Publication date: 5 November 2002
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1150
Related Items
Nontraceable detour graphs ⋮ The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing ⋮ The path partition conjecture is true for claw-free graphs ⋮ Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable ⋮ 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 ⋮ Unnamed Item ⋮ The open detour number of a graph
