Sciweavers

COCO
2010
Springer
131views Algorithms» more  COCO 2010»
13 years 9 months ago
On the Matching Problem for Special Graph Classes
An even cycle in a graph is called nice by Lov
Thanh Minh Hoang
JCT
2010
158views more  JCT 2010»
13 years 10 months ago
An asymptotic solution to the cycle decomposition problem for complete graphs
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...
Darryn E. Bryant, Daniel Horsley
JCT
2007
76views more  JCT 2007»
13 years 11 months ago
Perfect matchings extend to Hamilton cycles in hypercubes
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.
Jirí Fink
JCT
2007
93views more  JCT 2007»
13 years 11 months ago
Generating bricks
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...
Serguei Norine, Robin Thomas
SIAMDM
2008
101views more  SIAMDM 2008»
13 years 11 months ago
Hamilton Cycles in Random Lifts of Directed Graphs
An n-lift of a digraph K, is a digraph with vertex set V (K)
Prasad Chebolu, Alan M. Frieze
DM
2006
66views more  DM 2006»
13 years 11 months ago
On the role of hypercubes in the resonance graphs of benzenoid graphs
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...
Khaled Salem, Sandi Klavzar, Ivan Gutman
DM
2006
103views more  DM 2006»
13 years 11 months ago
Bounds on the forcing numbers of bipartite graphs
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...
Seth Kleinerman
APPROX
2006
Springer
117views Algorithms» more  APPROX 2006»
14 years 3 months ago
Fractional Matching Via Balls-and-Bins
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...
Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
ESA
2004
Springer
132views Algorithms» more  ESA 2004»
14 years 5 months ago
Seeking a Vertex of the Planar Matching Polytope in NC
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, ...
Raghav Kulkarni, Meena Mahajan
PCI
2005
Springer
14 years 5 months ago
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching
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...
Stavros D. Nikolopoulos, Leonidas Palios