AbstractWe disprove a conjecture of [Cook and Evans (1979)] by providing a number (the Stirling number of the second kind S(n, s) of them) of non-isomorphic s-chromatic graphs (s ⩾ 2) which fold onto Kn and are minimal in the number of vertices and edges. We also answer some other questions of [Cook and Evans (1979)]
Let c be an edge-colouring of the complete n-graph Kn with m colours. A totally multicoloured (TMC) ...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
Abstractα(k, l; r) denotes the smallest number of vertices in any graph G that has the properties; 1...
AbstractWe disprove a conjecture of [Cook and Evans (1979)] by providing a number (the Stirling numb...
summary:In this paper we characterize $k$-chromatic graphs without isolated vertices and connected $...
summary:In this paper we characterize $k$-chromatic graphs without isolated vertices and connected $...
summary:In this paper, we show that the maximal number of minimal colourings of a graph with $n$ ver...
summary:In this paper, we show that the maximal number of minimal colourings of a graph with $n$ ver...
Abstract. A graph G is r-ramsey-minimal with respect to Kk if every rcolouring of the edges of G yie...
AbstractLet G be a minimally k-edge-connected simple graph and vk(G) be the number of vertices of de...
AbstractGraphs, regarded as grammar forms as well as coloring specifications, induce graph-families,...
AbstractMiller was the first to investigate the problem of the chromatic number of set-systems. In t...
Let F be a graph and let G, H denote nonempty families of graphs. We write F → (G,H) if in any 2-col...
AbstractIn this paper, we give counterexamples to the conjecture: “Every nonempty regular simple gra...
AbstractUsing the operation of amalgamation we prove that for every k, n, p there exists a k-graph G...
Let c be an edge-colouring of the complete n-graph Kn with m colours. A totally multicoloured (TMC) ...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
Abstractα(k, l; r) denotes the smallest number of vertices in any graph G that has the properties; 1...
AbstractWe disprove a conjecture of [Cook and Evans (1979)] by providing a number (the Stirling numb...
summary:In this paper we characterize $k$-chromatic graphs without isolated vertices and connected $...
summary:In this paper we characterize $k$-chromatic graphs without isolated vertices and connected $...
summary:In this paper, we show that the maximal number of minimal colourings of a graph with $n$ ver...
summary:In this paper, we show that the maximal number of minimal colourings of a graph with $n$ ver...
Abstract. A graph G is r-ramsey-minimal with respect to Kk if every rcolouring of the edges of G yie...
AbstractLet G be a minimally k-edge-connected simple graph and vk(G) be the number of vertices of de...
AbstractGraphs, regarded as grammar forms as well as coloring specifications, induce graph-families,...
AbstractMiller was the first to investigate the problem of the chromatic number of set-systems. In t...
Let F be a graph and let G, H denote nonempty families of graphs. We write F → (G,H) if in any 2-col...
AbstractIn this paper, we give counterexamples to the conjecture: “Every nonempty regular simple gra...
AbstractUsing the operation of amalgamation we prove that for every k, n, p there exists a k-graph G...
Let c be an edge-colouring of the complete n-graph Kn with m colours. A totally multicoloured (TMC) ...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
Abstractα(k, l; r) denotes the smallest number of vertices in any graph G that has the properties; 1...
DOI
Add to ORKG