On the circumference of a graph and its complement

DOI10.1016/j.disc.2008.05.041zbMath1189.05081OpenAlexW1969179629MaRDI QIDQ1045133

Ingo Schiermeyer, Linda Lesniak, Ralph J. Faudree

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.05.041

zbMATH Keywords

graphRamsey numberscircumferencecomplement

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (11)

Monochromatic cycle partitions of graphs with large minimum degree ⋮ The Ramsey numbers of two sets of cycles ⋮ Three results on cycle-wheel Ramsey numbers ⋮ The Ramsey numbers of wheels versus odd cycles ⋮ Some remarks on long monochromatic cycles in edge-colored complete graphs ⋮ On star-critical and upper size Ramsey numbers ⋮ Cycles Avoiding a Color in Colorful Graphs ⋮ Star-critical Ramsey numbers of cycles versus wheels ⋮ A theorem on cycle-wheel Ramsey number ⋮ Ramsey Results for Cycle Spectra ⋮ The Monochromatic Circumference of 2‐Edge‐Colored Graphs

Cites Work

• All Ramsey numbers for cycles in graphs
• A method in graph theory
• Three-color Ramsey numbers for paths
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
• Note on Hamilton Circuits
• Degree sums for edges and cycle lengths in graphs

This page was built for publication: On the circumference of a graph and its complement