Detour Chromatic Numbers

DOI10.7151/DMGT.1150MaRDI QIDQ4542874zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• An asymptotic result for the path partition conjecture
• Path partitions and \(P_{n}\)-free sets
• Nontraceable detour graphs
• Path partitionable graphs
• The path partition conjecture is true for claw-free graphs

Cited in

(9)

• Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
• The open detour number of a graph
• scientific article; zbMATH DE number 2230277 (Why is no real title available?)
• Nontraceable detour graphs
• Minimum \(k\)-path vertex cover
• Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments
• The path partition conjecture is true for claw-free graphs
• The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing
• Eternal chromatic number

This page was built for publication: Detour Chromatic Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542874)