AbstractWe prove that if k ≥ 3 and there exists a regular graph with valency k, edge connectivity k and chromatic index k + 1, then there exists such a graph of any girth g ≥ 4
For certain positive integers k it is shown that there is no k-regular graph with girth 5 having k2 ...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
AbstractFor each d such that d-1 is prime, a d-valent graph of girth 6 having 2(d2−d+1) vertices is ...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
AbstractWe show that for each ε>0, there exists a number g such that the circular chromatic index of...
AbstractIn this paper, we show that for any given two positive integers g and k with g⩾3, there exis...
AbstractErdős proved that there are graphs with arbitrarily large girth and chromatic number. We stu...
Let k ≥ 1 be an odd integer, t = ⌊ k+2 ⌋, and q be a prime power. We 4 construct a bipartite, q–reg...
ABSTRACT. In this series, we investigate the conditions under which both a graph G and its complemen...
This works presents a formalization of the Girth-Chromatic num-ber theorem in graph theory, stating ...
An edge-girth-regular egr(v, k, g, lambda)-graph Gamma is a k-regular graph of order v and girth g i...
We give a new proof of the classical Erdös theorem on the existence of graphs with arbitrarily high ...
AbstractAn acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cyc...
AbstractWe give a graph of girth 5 and valency 5 having 30 vertices. It is shown that this is the mi...
AbstractLet k ⩾ 3 be a positive odd integer and 1 be a power of a prime. In this paper we give an ex...
For certain positive integers k it is shown that there is no k-regular graph with girth 5 having k2 ...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
AbstractFor each d such that d-1 is prime, a d-valent graph of girth 6 having 2(d2−d+1) vertices is ...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
AbstractWe show that for each ε>0, there exists a number g such that the circular chromatic index of...
AbstractIn this paper, we show that for any given two positive integers g and k with g⩾3, there exis...
AbstractErdős proved that there are graphs with arbitrarily large girth and chromatic number. We stu...
Let k ≥ 1 be an odd integer, t = ⌊ k+2 ⌋, and q be a prime power. We 4 construct a bipartite, q–reg...
ABSTRACT. In this series, we investigate the conditions under which both a graph G and its complemen...
This works presents a formalization of the Girth-Chromatic num-ber theorem in graph theory, stating ...
An edge-girth-regular egr(v, k, g, lambda)-graph Gamma is a k-regular graph of order v and girth g i...
We give a new proof of the classical Erdös theorem on the existence of graphs with arbitrarily high ...
AbstractAn acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cyc...
AbstractWe give a graph of girth 5 and valency 5 having 30 vertices. It is shown that this is the mi...
AbstractLet k ⩾ 3 be a positive odd integer and 1 be a power of a prime. In this paper we give an ex...
For certain positive integers k it is shown that there is no k-regular graph with girth 5 having k2 ...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
AbstractFor each d such that d-1 is prime, a d-valent graph of girth 6 having 2(d2−d+1) vertices is ...
DOI
Add to ORKG