Construction of Special Edge-Chromatic Graphs
From MaRDI portal
Publication:5341594
DOI10.4153/CMB-1965-041-7zbMath0132.21205OpenAlexW2018537445MaRDI QIDQ5341594
Publication date: 1965
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cmb-1965-041-7
Related Items
Subgraph counting identities and Ramsey numbers, On the Ramsey numbers R(3,8) and R(3,9), Ramsey numbers for graphs with five vertices, Sum-free sets and Ramsey numbers, On the Ramsey numbers for stars versus complete graphs, Sum-free sets and Ramsey numbers. II, Triangular Ramsey Numbers, R(4, 5) = 25, New lower bounds for 28 classical Ramsey numbers, New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14), Another analog of Ramsey numbers, On Ramsey numbers and \(K_ r\)-coloring of graphs, A note on upper bounds for some Ramsey numbers, A survey of bounds for classical Ramsey numbers, Path Ramsey numbers in multicolorings, On Some Open Questions for Ramsey and Folkman Numbers, Idiosynchromatic poetry