scientific article; zbMATH DE number 568810
From MaRDI portal
Publication:4294602
zbMATH Open0793.05061MaRDI QIDQ4294602FDOQ4294602
Authors: Farrokh Saba, Garry Johns 
Publication date: 8 August 1994
Title of this publication is not available (Why is that?)
Recommendations
- Path chromatic numbers of graphs
- On the chromatic number of graphs
- On path-chromatically unique graphs
- On the chromatic number of path graph \(P_3(G)\)
- On the \(k\)-path-chromatic number of complementary graphs
- scientific article; zbMATH DE number 1308944
- scientific article; zbMATH DE number 77956
- On the chromatic index of path decompositions
- scientific article; zbMATH DE number 4128832
- On chromaticity of graphs
Cited In (14)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
- Title not available (Why is that?)
- On the chromatic index of path decompositions
- Locating chromatic number of powers of paths and cycles
- On radio \((n-4)\)-chromatic number of the path \(P_n\)
- Title not available (Why is that?)
- On monochromatic component size for improper colourings
- 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 \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing
- Relaxed chromatic numbers of graphs
- Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs
- Paths with two blocks in \(k\)-chromatic digraphs
- On computing the path number of a graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294602)
