On the maximal triangle-free edge-chromatic graphs in three colors

DOI10.1016/S0021-9800(68)80024-9MaRDI QIDQ5548828zbMATH OpenFDO

Authors J. G. Kalbfleisch, R. G. Stanton

Publication date 1968

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0021-9800(68)80024-9

zbMATH Keywords

maximal triangle-free edge-chromatic graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• A class of three-colorable triangle-free graphs
• On colorful edge triples in edge-colored complete graphs
• On parsimonious edge-colouring of graphs with maximum degree three
• Structures and chromaticity of some extremal 3-colourable graphs
• On the chromatic number of triangle-free graphs of large minimum degree
• Edge colorings of complete graphs without tricolored triangles
• On Ramsey number \(R(4,3,3)\) and triangle-free edge-chromatic graphs in three colors
• The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
• Triangle-free graphs with large chromatic numbers
• scientific article; zbMATH DE number 4208097

Cited in

(26)

• The Ramsey number \(r(C_ 4,C_ 4,C_ 4)\)
• Lower bounds for Ramsey numbers and association schemes
• A simple construction giving the two non-isomorphic triangle-free 3-colored \(K_{16}\)'s
• On group partitions associated with lower bounds for symmetric Ramsey numbers
• Difference sets and sum-free sets in groups of order 16
• Sur les R-coloriages minimaux
• Tractability through symmetries in propositional calculus
• On Ramsey number \(R(4,3,3)\) and triangle-free edge-chromatic graphs in three colors
• Notes on the Ramsey number N(3,3,3,3)
• Subcompletions of representable relation algebras
• Some geometrical aspects of a maximal three-coloured triangle-free graph
• An improved upper bound for Ramsey number R(3,3,3,3;2)
• The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs
• Constraints for symmetry breaking in graph representation
• 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)
• scientific article; zbMATH DE number 7068502 (Why is no real title available?)
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• Monochromatic \(K_{r}\)-decompositions of graphs
• Triangle-free Uniquely 3-Edge Colorable Cubic Graphs
• Edge colourings and qualitative representations of chromatic algebras
• A threading path to a Ramsey number
• A quantum-inspired mechanical method for proving of Ramsey's theorem by symbolic computation over the finite field GF(2)
• The four-color Ramsey multiplicity of triangles
• A new construction technique of a triangle-free 3-colored K16's

This page was built for publication: On the maximal triangle-free edge-chromatic graphs in three colors

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