On the maximal triangle-free edge-chromatic graphs in three colors
From MaRDI portal
Publication:5548828
DOI10.1016/S0021-9800(68)80024-9zbMATH Open0164.24702MaRDI QIDQ5548828FDOQ5548828
Authors: J. G. Kalbfleisch, R. G. Stanton 
Publication date: 1968
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
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 (24)
- Sur les R-coloriages minimaux
- Tractability through symmetries in propositional calculus
- Lower bounds for Ramsey numbers and association schemes
- Algebraic structure of chromatic graphs associated with the Ramsey number N(3,3,3; 2)
- Triangle-free Uniquely 3-Edge Colorable Cubic Graphs
- Monochromatic Kr‐Decompositions of Graphs
- Subcompletions of representable relation algebras
- Constraints for symmetry breaking in graph representation
- Title not available (Why is that?)
- Edge colourings and qualitative representations of chromatic algebras
- A new construction technique of a triangle-free 3-colored K16's
- 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
- Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
- Notes on the Ramsey number N(3,3,3,3)
- The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs
- 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
- A threading path to a Ramsey number
- The Ramsey number N(3,3,3,3;2)
- The Ramsey number \(r(C_ 4,C_ 4,C_ 4)\)
- Some geometrical aspects of a maximal three-coloured triangle-free graph
- On the Ramsey numbers N(3,3,\dots ,3;2)
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)
