Monochromatic Paths in Graphs

DOI10.1016/S0167-5060(08)70507-7zbMath0388.05031OpenAlexW1664893882MaRDI QIDQ4168638

No author found.

Publication date: 1978

Published in: Advances in Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70507-7

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (20)

Generalizations and strengthenings of Ryser's conjecture ⋮ Monochromatic infinite paths ⋮ Density of monochromatic infinite paths ⋮ Partitioning complete bipartite graphs by monochromatic cycles ⋮ Decompositions of edge-colored infinite complete graphs into monochromatic paths ⋮ Partitioning infinite hypergraphs into few monochromatic Berge-paths ⋮ Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Heterochromatic tree partition problem in complete tripartite graphs ⋮ Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths ⋮ Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs ⋮ Minimum degree conditions for monochromatic cycle partitioning ⋮ Vertex coverings by monochromatic cycles and trees ⋮ Heterochromatic tree partition numbers for complete bipartite graphs ⋮ Partitioning random graphs into monochromatic components ⋮ Heterochromatic tree partition number in complete multipartite graphs ⋮ Partitioning complete graphs by heterochromatic trees ⋮ Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs ⋮ The Rado path decomposition theorem ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey

This page was built for publication: Monochromatic Paths in Graphs