In 1996, Ota and Tokuda showed that a star-free graph with sufficiently high minimum degree admits a 2-factor. More recently it was shown that the minimum degree condition can be ...
: We prove that the strong product G1 G2 of G1 and G2 is Z3-flow contractible if and only if G1 G2 is not T K2, where T is a tree (we call T K2 a K4-tree). It follows that G1 G2 ad...
Wilfried Imrich, Iztok Peterin, Simon Spacapan, Cu...
: 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...
: 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...
. Dirac. Some theorems on abstract graphs. Proc. London Math. Soc. (3), 2:69–81, 1952. [2] Hikoe Enomoto and Katsuhiro Ota. Partitions of a graph into paths with prescribed endve...
The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. According to the Crossing Lemma of Ajtai, Chv´atal, Newborn, Sze...
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...