AbstractIf G is a graph with k ⩾ 1 odd cycle lengths then each block of G is either K2k+2 or contains a vertex of degree at most 2k. As a consequence, the chromatic number of G is at most 2k+2
AbstractFor a simple finite graph G let Co(G) and Ce(G) denote the set of odd cycle lengths and even...
Let G be a 2-connected graph with minimum degree d I. Hartman proved that the cycles of length at le...
AbstractIn 1992 Gyárfás showed that a graph G having only k odd cycle lengths is (2k+1)-colourable, ...
AbstractIn 1992 Gyárfás showed that a graph G having only k odd cycle lengths is (2k+1)-colourable, ...
AbstractIf G is a graph with k ⩾ 1 odd cycle lengths then each block of G is either K2k+2 or contain...
In 1966 Erdös and Hajnal proved that the chromatic number of graphs whose odd cycles have lengths at...
In 1966 Erdös and Hajnal proved that the chromatic number of graphs whose odd cycles have lengths at...
In 1966 Erdös and Hajnal proved that the chromatic number of graphs whose odd cycles have lengths at...
In 1966 Erdös and Hajnal proved that the chromatic number of graphs whose odd cycles have lengths at...
AbstractLet G be a 2-connected graph in which the degree of every vertex is at least d. We prove tha...
AbstractLet G be a 2-connected graph in which the degree of every vertex is at least d. We prove tha...
In 1981, Erdős and Hajnal asked whether the sum of the reciprocals of the odd cycle lengths in a gra...
In 1981, Erd\H{o}s and Hajnal asked whether the sum of the reciprocals of the odd cycle lengths in a...
AbstractIn this paper we solve a conjecture of P. Erdös by showing that if a graph Gn has n vertices...
AbstractFor k⩾1 the odd wheel of 2k+1 spokes, denoted by W2k+1, is the graph obtained from a cycle o...
AbstractFor a simple finite graph G let Co(G) and Ce(G) denote the set of odd cycle lengths and even...
Let G be a 2-connected graph with minimum degree d I. Hartman proved that the cycles of length at le...
AbstractIn 1992 Gyárfás showed that a graph G having only k odd cycle lengths is (2k+1)-colourable, ...
AbstractIn 1992 Gyárfás showed that a graph G having only k odd cycle lengths is (2k+1)-colourable, ...
AbstractIf G is a graph with k ⩾ 1 odd cycle lengths then each block of G is either K2k+2 or contain...
In 1966 Erdös and Hajnal proved that the chromatic number of graphs whose odd cycles have lengths at...
In 1966 Erdös and Hajnal proved that the chromatic number of graphs whose odd cycles have lengths at...
In 1966 Erdös and Hajnal proved that the chromatic number of graphs whose odd cycles have lengths at...
In 1966 Erdös and Hajnal proved that the chromatic number of graphs whose odd cycles have lengths at...
AbstractLet G be a 2-connected graph in which the degree of every vertex is at least d. We prove tha...
AbstractLet G be a 2-connected graph in which the degree of every vertex is at least d. We prove tha...
In 1981, Erdős and Hajnal asked whether the sum of the reciprocals of the odd cycle lengths in a gra...
In 1981, Erd\H{o}s and Hajnal asked whether the sum of the reciprocals of the odd cycle lengths in a...
AbstractIn this paper we solve a conjecture of P. Erdös by showing that if a graph Gn has n vertices...
AbstractFor k⩾1 the odd wheel of 2k+1 spokes, denoted by W2k+1, is the graph obtained from a cycle o...
AbstractFor a simple finite graph G let Co(G) and Ce(G) denote the set of odd cycle lengths and even...
Let G be a 2-connected graph with minimum degree d I. Hartman proved that the cycles of length at le...
AbstractIn 1992 Gyárfás showed that a graph G having only k odd cycle lengths is (2k+1)-colourable, ...
DOI
Add to ORKG