DAM
2011
13 years 6 months ago
2011
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less or equal to a given constant is ∗ Research supported by grants No. 1M0545...
JGT
2010
13 years 10 months ago
2010
: Let G be a toroidal graph without cycles of a fixed length k, and l(G) the list chromatic number of G. We establish tight upper bounds Contract grant sponsor: RGC; Contract grant...
JGT
2010
13 years 10 months ago
2010
: A well-known result of Tutte states that a 3-connected graph G is planar if and only if every edge of G is contained in exactly two induced non-separating circuits. Bixby and Cun...