The following pages link to On split-coloring problems (Q995923):
Displaying 9 items.
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (Q456142) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- Partitioning graphs into complete and empty graphs (Q1045126) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- Generalised online colouring problems in overlap graphs (Q2034796) (← links)
- Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
- Partitioning cographs into cliques and stable sets (Q2568333) (← links)
- Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
