The following pages link to (Q3490030):
Displaying 5 items.
- Vertex partitions of \(r\)-edge-colored graphs (Q933003) (← links)
- Chromatic partitions of a graph (Q1263595) (← links)
- A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs (Q2142650) (← links)
- A universal partition result for infinite homogeneous \(K_n\)-free and related graphs (Q2219943) (← links)
- Partitioning the power set of \([n]\) into \(C_k\)-free parts (Q2323815) (← links)