COCO
2010
Springer
13 years 4 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
JCT
2010
13 years 5 months ago
2010
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...
JCT
2007
13 years 6 months ago
2007
Kreweras’ conjecture [1] asserts that any perfect matching of the hypercube Qd, d ≥ 2, can be extended to a Hamilton cycle. We prove this conjecture.
JCT
2007
13 years 6 months ago
2007
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that...
SIAMDM
2008
13 years 6 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
DM
2006
13 years 7 months ago
2006
The resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, two perfect matchings being adjacent13 if their symmetric difference forms the edge set...
DM
2006
13 years 7 months ago
2006
The forcing number of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matching of G. In this paper, we demon...
APPROX
2006
Springer
13 years 10 months ago
2006
Springer
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
ESA
2004
Springer
14 years 10 days ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
PCI
2005
Springer
14 years 13 days ago
2005
Springer
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect...