Vertex coverings by monochromatic paths and cycles
From MaRDI portal
Publication:4749866
DOI10.1002/jgt.3190070116zbMath0511.05046OpenAlexW1968948734MaRDI QIDQ4749866
No author found.
Publication date: 1983
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190070116
Paths and cycles (05C38) Generalized Ramsey theory (05C55) Directed graphs (digraphs), tournaments (05C20)
Related Items (32)
Zeons, orthozeons, and graph colorings ⋮ Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Monochromatic Cycle Partitions in Local Edge Colorings ⋮ Monochromatic cycle partitions of graphs with large minimum degree ⋮ Vertex covering with monochromatic pieces of few colours ⋮ Cover \(k\)-uniform hypergraphs by monochromatic loose paths ⋮ Partitioning edge-coloured complete graphs into monochromatic cycles and paths ⋮ Monochromatic paths in random tournaments ⋮ Heterochromatic tree partition problem in complete tripartite graphs ⋮ The size Ramsey number of a directed path ⋮ Monochromatic paths in 2-edge-coloured graphs and hypergraphs ⋮ Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles ⋮ Calculating Ramsey Numbers by Partitioning Colored Graphs ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Minimum degree conditions for monochromatic cycle partitioning ⋮ Vertex coverings by monochromatic cycles and trees ⋮ Heterochromatic tree partition numbers for complete bipartite graphs ⋮ Vertex partitions of \(r\)-edge-colored graphs ⋮ Partitioning 2-edge-colored graphs by monochromatic paths and cycles ⋮ Coverings by few monochromatic pieces: a transition between two Ramsey problems ⋮ Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) ⋮ The complexity for partitioning graphs by monochromatic trees, cycles and paths ⋮ Heterochromatic tree partition number in complete multipartite graphs ⋮ Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees ⋮ Partitioning complete graphs by heterochromatic trees ⋮ Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture ⋮ Unnamed Item ⋮ Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Partitioning a graph into a cycle and a sparse graph ⋮ Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles
Cites Work
This page was built for publication: Vertex coverings by monochromatic paths and cycles
