A uniqueness theorem for edge-chromatic graphs
From MaRDI portal
Publication:2525288
DOI10.2140/pjm.1967.21.503zbMath0149.41405MaRDI QIDQ2525288
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
Related Items
Sum-free sets and Ramsey numbers. II, On Ramsey number \(R(4,3,3)\) and triangle-free edge-chromatic graphs in three colors, New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14), An upper bound for the Ramsey number M(5,4), On Ramsey numbers and \(K_ r\)-coloring of graphs, Ramsey's theorem and self-complementary graphs, Ramsey numbers for graphs with five vertices