Name
Abstract | ||
|---|---|---|
A graph G satisfies the neighborhood condition ANC( G ) ⩾ m if, for all pairs of vertices of G , the union of their neighborhoods has at least m vertices. For a fixed positive integer k , let G be a graph of even order n which satisfies the following conditions: δ( G ) ⩾ k + 1; K 1 ( G ) ⩾ k ; and ANC( G ) ⩾ n /2. It is shown that if n is sufficiently large then G contains k edge-disjoint perfect matchings. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0012-365X(91)90160-4 | Discrete Mathematics |
Keywords | Field | DocType |
edge-disjoint perfect matchings,neighborhood condition | Integer,Graph,Discrete mathematics,Combinatorics,Disjoint sets,Vertex (geometry),Vertex (graph theory),Bipartite graph,Mathematics | Journal |
Volume | Issue | ISSN |
91 | 1 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.38 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. J. Faudree | 1 | 174 | 38.15 |
| R. J. Gould | 2 | 23 | 4.92 |
| L. M. Lesniak | 3 | 44 | 8.23 |