A uniqueness theorem for edge-chromatic graphs

DOI10.2140/PJM.1967.21.503MaRDI QIDQ2525288zbMATH OpenOpenAlexFDO

Authors J. G. Kalbfleisch

Publication date 1967

Published in Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/pjm.1967.21.503

zbMATH Keywords

topology

Cited in

(7)

• Ramsey numbers for graphs with five vertices
• New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14)
• On Ramsey number \(R(4,3,3)\) and triangle-free edge-chromatic graphs in three colors
• On Ramsey numbers and \(K_ r\)-coloring of graphs
• Ramsey's theorem and self-complementary graphs
• An upper bound for the Ramsey number M(5,4)
• Sum-free sets and Ramsey numbers. II

This page was built for publication: A uniqueness theorem for edge-chromatic graphs

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