Name
Abstract | ||
|---|---|---|
Mader [Arch. Math. 23 (1972), 219–224] determined the minimal number of 1-factors in a 2k-connected graph having at least one 1-factor. We give a simple proof of this result and slightly extend it. |
Year | DOI | Venue |
|---|---|---|
1978 | 10.1016/0095-8956(78)90011-4 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
connected graph | Block graph,Discrete mathematics,Modular decomposition,Combinatorics,Graph toughness,Line graph,Distance-hereditary graph,Pancyclic graph,Planar graph,Mathematics,Triangle-free graph | Journal |
Volume | Issue | ISSN |
25 | 3 | 0095-8956 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bela Bollobas | 1 | 66 | 12.05 |