The following pages link to (Q5560916):
Displaying 22 items.
- WORM colorings of planar graphs (Q521753) (← links)
- The \(t\)-tone chromatic number of random graphs (Q742618) (← links)
- Induced-path partition on graphs with special blocks (Q868947) (← links)
- The path partition conjecture is true for claw-free graphs (Q878616) (← links)
- Chromatic partitions of a graph (Q1263595) (← links)
- A sequential coloring algorithm for finite sets (Q1297462) (← links)
- Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs (Q1356650) (← links)
- The complexity of \(G\)-free colourability (Q1356726) (← links)
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← 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)
- A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs (Q2142650) (← links)
- On the vertex arboricity of planar graphs of diameter two (Q2384426) (← links)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
- Chromatic sums for colorings avoiding monochromatic subgraphs (Q2516680) (← links)
- Graphs with forbidden subgraphs (Q2547895) (← links)
- Colorings of plane graphs without long monochromatic facial paths (Q2656334) (← links)
- Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (Q4978291) (← links)
- My Top 10 Graph Theory Conjectures and Open Problems (Q5506779) (← links)
- Graph theory (Q5917392) (← links)
