Detour Chromatic Numbers

DOI10.7151/dmgt.1150zbMath1002.05021OpenAlexW2083401018WikidataQ130461550 ScholiaQ130461550MaRDI 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

zbMATH Keywords

detourpath partition conjecturegeneralized colouringnearly bipartite

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

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

This page was built for publication: Detour Chromatic Numbers