The following pages link to (Q3688407):
Displaying 22 items.
- Partitions of graphs into cographs (Q607000) (← links)
- Induced-path partition on graphs with special blocks (Q868947) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- The existence of uniquely \(-G\) colourable graphs (Q1377702) (← links)
- Subcolorings and the subchromatic number of a graph (Q1412662) (← links)
- On uniquely partitionable planar graphs (Q1584417) (← links)
- Path choosability of planar graphs (Q1627209) (← links)
- On monochromatic component size for improper colourings (Q1775062) (← links)
- Generalizations of independence and chromatic numbers of a graph (Q1801703) (← links)
- Conditional chromatic numbers with forbidden cycles (Q1805306) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- On the minimal reducible bound for outerplanar and planar graphs (Q1916137) (← links)
- On path-chromatically unique graphs (Q1916374) (← links)
- The complexity of generalized graph colorings (Q1923585) (← 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)
- Chromatic sums for colorings avoiding monochromatic subgraphs (Q2516680) (← links)
- The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing (Q2661539) (← links)
- Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
- ON UNIQUELY -G k-COLOURABLE GRAPHS (Q4034558) (← links)
- (Q5708621) (← links)
- Acyclic colorings of planar graphs (Q5905418) (← links)
