Add to ORKGThis works presents a formalization of the Girth-Chromatic num-ber theorem in graph theory, stating that graphs with arbitrarily large girth and chromatic number exist. The proof uses the theory of Ran-dom Graphs to prove the existence with probabilistic arguments and is based on [1]
A natural digraph analogue of the graph-theoretic concept of an `independent set' is that of an `acy...
A natural digraph analogue of the graph-theoretic concept of an `independent set' is that of an `acy...
The existance of planar graphs with odd girth 2k + 1 and high girth that cannot be (2k + 1, k)-colou...
We give a new proof of the classical Erdös theorem on the existence of graphs with arbitrarily high ...
AbstractErdős proved that there are graphs with arbitrarily large girth and chromatic number. We stu...
AbstractErdős proved that there are graphs with arbitrarily large girth and chromatic number. We stu...
Abstract. In this short note, we extend the result of Galluccio, Goddyn, and Hell, which states that...
Abstract. Erdős proved that there are graphs with arbitrarily large girth and chromatic number. We s...
A b-coloring of a graph is a coloring of its vertices such that every color class contains a vertex ...
AbstractWe prove that if k ≥ 3 and there exists a regular graph with valency k, edge connectivity k ...
AbstractWe show that a planar graph with girth at least 20t−23 has circular chromatic number at most...
[[abstract]]This paper completes the constructive proof of the following result: Suppose p/q≥2 is a ...
AbstractIt is shown that a graph of large girth and minimum degree at least 3 share many properties ...
AbstractIt is shown that the list edge chromatic number of any graph with maximal degree Δ and girth...
AbstractThe chromatic capacity of a graph G,χCAP(G), is the largest integer k such that there is a k...
A natural digraph analogue of the graph-theoretic concept of an `independent set' is that of an `acy...
A natural digraph analogue of the graph-theoretic concept of an `independent set' is that of an `acy...
The existance of planar graphs with odd girth 2k + 1 and high girth that cannot be (2k + 1, k)-colou...
We give a new proof of the classical Erdös theorem on the existence of graphs with arbitrarily high ...
AbstractErdős proved that there are graphs with arbitrarily large girth and chromatic number. We stu...
AbstractErdős proved that there are graphs with arbitrarily large girth and chromatic number. We stu...
Abstract. In this short note, we extend the result of Galluccio, Goddyn, and Hell, which states that...
Abstract. Erdős proved that there are graphs with arbitrarily large girth and chromatic number. We s...
A b-coloring of a graph is a coloring of its vertices such that every color class contains a vertex ...
AbstractWe prove that if k ≥ 3 and there exists a regular graph with valency k, edge connectivity k ...
AbstractWe show that a planar graph with girth at least 20t−23 has circular chromatic number at most...
[[abstract]]This paper completes the constructive proof of the following result: Suppose p/q≥2 is a ...
AbstractIt is shown that a graph of large girth and minimum degree at least 3 share many properties ...
AbstractIt is shown that the list edge chromatic number of any graph with maximal degree Δ and girth...
AbstractThe chromatic capacity of a graph G,χCAP(G), is the largest integer k such that there is a k...
A natural digraph analogue of the graph-theoretic concept of an `independent set' is that of an `acy...
A natural digraph analogue of the graph-theoretic concept of an `independent set' is that of an `acy...
The existance of planar graphs with odd girth 2k + 1 and high girth that cannot be (2k + 1, k)-colou...