Pages that link to "Item:Q1569063"
From MaRDI portal
The following pages link to Vertex partitions by connected monochromatic \(k\)-regular graphs (Q1569063):
Displaying 17 items.
- Improved monochromatic loose cycle partitions in hypergraphs (Q396737) (← links)
- Monochromatic bounded degree subgraph partitions (Q501026) (← links)
- Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs (Q641170) (← links)
- An improved bound for the monochromatic cycle partition number (Q859613) (← links)
- Vertex partitions of \(r\)-edge-colored graphs (Q933003) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- Highly connected coloured subgraphs via the regularity Lemma (Q1045023) (← links)
- Monochromatic square-cycle and square-path partitions (Q2065889) (← links)
- Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
- Kaleidoscopic edge-coloring of complete graphs and \(r\)-regular graphs (Q2312066) (← links)
- Monochromatic cycle power partitions (Q2374161) (← links)
- Monochromatic cycle partitions of edge-colored graphs (Q3067062) (← links)
- Regular graphs with prescribed chromatic number (Q3470480) (← links)
- Destroying Noncomplete Regular Components in Graph Partitions (Q4908827) (← links)
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs (Q4920655) (← links)
- Local colourings and monochromatic partitions in complete bipartite graphs (Q5965537) (← links)
- Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles (Q6046228) (← links)
