The following pages link to Monochromatic Paths in Graphs (Q4168638):
Displaying 19 items.
- Heterochromatic tree partition problem in complete tripartite graphs (Q409432) (← links)
- Partitioning random graphs into monochromatic components (Q510329) (← links)
- Partitioning complete graphs by heterochromatic trees (Q692699) (← links)
- Heterochromatic tree partition numbers for complete bipartite graphs (Q932639) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- Vertex coverings by monochromatic cycles and trees (Q1174783) (← links)
- Partitioning complete bipartite graphs by monochromatic cycles (Q1354726) (← links)
- Density of monochromatic infinite paths (Q1627204) (← links)
- Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II (Q1678642) (← links)
- Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs (Q1783629) (← links)
- Generalizations and strengthenings of Ryser's conjecture (Q2121724) (← links)
- Partitioning infinite hypergraphs into few monochromatic Berge-paths (Q2175777) (← links)
- Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths (Q2200044) (← links)
- Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
- Heterochromatic tree partition number in complete multipartite graphs (Q2251133) (← links)
- The Rado path decomposition theorem (Q2279931) (← links)
- Monochromatic infinite paths (Q2366010) (← links)
- Decompositions of edge-colored infinite complete graphs into monochromatic paths (Q2397547) (← links)
- Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs (Q2700970) (← links)
