Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles
From MaRDI portal
Publication:2800590
DOI10.1002/jgt.21877zbMath1333.05235OpenAlexW1537582213MaRDI QIDQ2800590
Publication date: 15 April 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/43723/1/68.pdf
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
Ramsey number of paths and connected matchings in Ore-type host graphs ⋮ Large monochromatic components in edge colored graphs with a minimum degree condition ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Ramsey-Turán type results for matchings in edge colored graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Cites Work
- Unnamed Item
- Monochromatic cycle partitions of graphs with large minimum degree
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles
- Partitioning 3-colored complete graphs into three monochromatic cycles
- An improved bound for the monochromatic cycle partition number
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- Ore-type versions of Brooks' theorem
- Vertex coverings by monochromatic cycles and trees
- Three-color Ramsey numbers for paths
- An Ore-type theorem on equitable coloring
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- Monochromatic Cycles in 2-Coloured Graphs
- Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
- Note on Hamilton Circuits
- Tripartite Ramsey numbers for paths
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- Vertex coverings by monochromatic paths and cycles
- Degree conditions for k‐ordered hamiltonian graphs
- The Factorization of Linear Graphs
This page was built for publication: Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles
