On the maximal triangle-free edge-chromatic graphs in three colors
From MaRDI portal
Publication:5548828
DOI10.1016/S0021-9800(68)80024-9zbMath0164.24702MaRDI QIDQ5548828
J. G. Kalbfleisch, Ralph G.Stanton
Publication date: 1968
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items
The Ramsey number \(r(C_ 4,C_ 4,C_ 4)\) ⋮ Tractability through symmetries in propositional calculus ⋮ Lower bounds for Ramsey numbers and association schemes ⋮ A simple construction giving the two non-isomorphic triangle-free 3-colored \(K_{16}\)'s ⋮ An improved upper bound for Ramsey number \(R(3,3,3,3;2)\) ⋮ On Ramsey number \(R(4,3,3)\) and triangle-free edge-chromatic graphs in three colors ⋮ Subcompletions of representable relation algebras ⋮ A new construction technique of a triangle-free 3-colored K16's ⋮ Notes on the Ramsey number N(3,3,3,3) ⋮ Edge colourings and qualitative representations of chromatic algebras ⋮ On group partitions associated with lower bounds for symmetric Ramsey numbers ⋮ Minimum Number ofk-Cliques in Graphs with Bounded Independence Number ⋮ Monochromatic Kr‐Decompositions of Graphs ⋮ Difference sets and sum-free sets in groups of order 16 ⋮ Sur les R-coloriages minimaux ⋮ Unnamed Item ⋮ Algebraic structure of chromatic graphs associated with the Ramsey number N(3,3,3; 2) ⋮ The Ramsey number N(3,3,3,3;2) ⋮ On the Ramsey numbers N(3,3,\dots ,3;2) ⋮ Some geometrical aspects of a maximal three-coloured triangle-free graph ⋮ Constraints for symmetry breaking in graph representation
