On the existence of specified cycles in complementary graphs

DOI10.1090/S0002-9904-1971-12832-XMaRDI QIDQ5629661zbMATH OpenFDO

Authors Gary Chartrand, Seymour Schuster

Publication date 1971

Published in Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/S0002-9904-1971-12832-X

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites work

• Some graph theoretic results associated with Ramsey's theorem

Cited in

(21)

• Path-cycle Ramsey numbers
• All Ramsey numbers for cycles in graphs
• Path-path Ramsey type numbers for the complete bipartite graph
• The Ramsey numbers r(P\(_m\),K\(_n\))
• Ramsey numbers in complete balanced multipartite graphs. I: Set numbers
• Path-star Ramsey numbers
• Generalised Ramsey numbers for small graphs
• Stars and their \(k\)-Ramsey numbers
• Gallai-Ramsey number of even cycles with chords
• Gallai-Ramsey number of odd cycles with chords
• Polychromatic colorings of 1-regular and 2-regular subgraphs of complete graphs
• On Ramsey numbers for linear forests
• Ramsey numbers for cycles in graphs
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
• A note on cycle Ramsey numbers
• Ramsey Graphs and Block Designs. I
• Multicolor star-critical Ramsey numbers and Ramsey-good graphs
• Generalized Ramsey theory for graphs
• Ramsey numbers of ordered graphs
• Ramsey numbers of the quadrilateral versus books
• Ramsey non-goodness involving books

This page was built for publication: On the existence of specified cycles in complementary graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5629661)