AbstractThe edges of a complete graph on 16 vertices are colored with three colors in such a way that no unicolored triangles are formed. Two such, coloring schemes are known, and these are obtained here by a new method. In addition, we prove that these are the only ones possible
AbstractCombining recent results on colorings and Ramsey theory, we show that if G is a triangle-fre...
We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can b...
We present an algorithm to color a graph G with no triangle and no induced 7-vertex path (i.e., a {P...
AbstractLet KN be the complete graph on N vertices, and assume that each edge is assigned precisly o...
The chromatic number of a triangle-free graph can be arbitrarily large. In this article, we show tha...
This paper presents infinitely many new examples of triangle-free uniquely 3-edge colorable cubic gr...
In 1959, Goodman [9] determined the minimum number of monochromatic triangles in a complete graph wh...
AbstractBy applying a look-ahead algorithm, we show that there are, up to isomorphism, exactly two c...
AbstractThe edge-coloured complete graphs which contain no polychromatic circuits are studied, with ...
Abstract. In 1959, Goodman [8] determined the minimum number of monochromatic triangles in a complet...
AbstractIt is shown that there are two positive constants c1,c2 such that the maximum possible chrom...
We show some consequences of results of Gallai concerning edge colorings of complete graphs that con...
AbstractTriangle-free graphs of order n with minimum degree exceeding n/3 satisfy strong structural ...
AbstractFor given n, let G be a triangle-free graph of order n with chromatic number at least 4. In ...
For an edge-colored graph, its minimum color degree is the minimum number of distinct colors appeari...
AbstractCombining recent results on colorings and Ramsey theory, we show that if G is a triangle-fre...
We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can b...
We present an algorithm to color a graph G with no triangle and no induced 7-vertex path (i.e., a {P...
AbstractLet KN be the complete graph on N vertices, and assume that each edge is assigned precisly o...
The chromatic number of a triangle-free graph can be arbitrarily large. In this article, we show tha...
This paper presents infinitely many new examples of triangle-free uniquely 3-edge colorable cubic gr...
In 1959, Goodman [9] determined the minimum number of monochromatic triangles in a complete graph wh...
AbstractBy applying a look-ahead algorithm, we show that there are, up to isomorphism, exactly two c...
AbstractThe edge-coloured complete graphs which contain no polychromatic circuits are studied, with ...
Abstract. In 1959, Goodman [8] determined the minimum number of monochromatic triangles in a complet...
AbstractIt is shown that there are two positive constants c1,c2 such that the maximum possible chrom...
We show some consequences of results of Gallai concerning edge colorings of complete graphs that con...
AbstractTriangle-free graphs of order n with minimum degree exceeding n/3 satisfy strong structural ...
AbstractFor given n, let G be a triangle-free graph of order n with chromatic number at least 4. In ...
For an edge-colored graph, its minimum color degree is the minimum number of distinct colors appeari...
AbstractCombining recent results on colorings and Ramsey theory, we show that if G is a triangle-fre...
We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can b...
We present an algorithm to color a graph G with no triangle and no induced 7-vertex path (i.e., a {P...
DOI
Add to ORKG