The following pages link to (Q4294602):
Displaying 14 items.
- On radio \((n-4)\)-chromatic number of the path \(P_n\) (Q624132) (← links)
- Relaxed chromatic numbers of graphs (Q1323496) (← links)
- Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs (Q1356650) (← links)
- On monochromatic component size for improper colourings (Q1775062) (← links)
- On the chromatic index of path decompositions (Q1876679) (← links)
- Paths with two blocks in \(k\)-chromatic digraphs (Q1886358) (← links)
- On computing the path number of a graph (Q2132346) (← 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)
- Locating chromatic number of powers of paths and cycles (Q2335071) (← 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)
- (Q3984228) (← links)
- (Q4255999) (← links)
