scientific article; zbMATH DE number 568810

zbMath0793.05061MaRDI QIDQ4294602

Farrokh Saba, Garry L. Johns

Publication date: 8 August 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

path-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs ⋮ The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing ⋮ Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable ⋮ 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 ⋮ Relaxed chromatic numbers of graphs

This page was built for publication: