The following pages link to Detour Chromatic Numbers (Q4542874):
Displaying 8 items.
- Nontraceable detour graphs (Q868352) (← links)
- The path partition conjecture is true for claw-free graphs (Q878616) (← links)
- Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments (Q2273901) (← links)
- Minimum \(k\)-path vertex cover (Q2275922) (← links)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
- The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing (Q2661539) (← links)
- (Q5708569) (← links)
- The open detour number of a graph (Q5859498) (← links)
