Sciweavers

JGT
2008
55views more  JGT 2008»
13 years 11 months ago
Ore-type degree conditions for a graph to be H-linked
Given a fixed multigraph H with V (H) = {h1, . . . , hm}, we say that a graph G is H-linked if for every choice of m vertices v1, . . . , vm in G, there exists a subdivision of H i...
Alexandr V. Kostochka, Gexin Yu
DAM
2010
95views more  DAM 2010»
13 years 11 months ago
Excessive factorizations of bipartite multigraphs
Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2...
David Cariolaro, Romeo Rizzi