The Monochromatic Circumference of 2‐Edge‐Colored Graphs
From MaRDI portal
Publication:5272638
DOI10.1002/jgt.22052zbMath1377.05072OpenAlexW2441619326MaRDI QIDQ5272638
No author found.
Publication date: 30 June 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22052
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Generalized Ramsey theory (05C55)
Related Items (5)
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree ⋮ Large monochromatic components in edge colored graphs with a minimum degree condition ⋮ On Schelp's problem for three odd long cycles ⋮ Long monochromatic paths and cycles in 2-colored bipartite graphs ⋮ Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree
Cites Work
- Some remarks on long monochromatic cycles in edge-colored complete graphs
- A new class of Ramsey-Turán problems
- On the circumference of a graph and its complement
- The longest cycles in a graph G with minimum degree at least \(| G| /k\)
- Blow-up lemma
- Monochromatic Cycles in 2-Coloured Graphs
- On maximal paths and circuits of graphs
- The Factorization of Linear Graphs
This page was built for publication: The Monochromatic Circumference of 2‐Edge‐Colored Graphs