Lower bound of cyclic edge connectivity for n-extendability of regular graphs
Authors:
- Dingjun LouDLDingjun Lou
- D.A. HoltonDHD.A. Holton
- 1 March 1993
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 112 (1-3) , 139-150
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Matching theory: L. Lovász and M. D. Plummer, North-Holland, 1986, 544 ppAdvances in Mathematics, 1990
- The asymptotic connectivity of labelled coloured regular bipartite graphs1983
- Cages—a surveyJournal of Graph Theory, 1982
- The asymptotic distribution of short cycles in random regular graphsJournal of Combinatorial Theory, Series B, 1981
- The asymptotic connectivity of labelled regular graphsJournal of Combinatorial Theory, Series B, 1981
- On n-extendable graphsDiscrete Mathematics, 1980
- Extremal graph theoryDiscrete Mathematics, 1979
- The asymptotic number of labeled graphs with given degree sequencesJournal of Combinatorial Theory, Series A, 1978
- Connectivity in Graphs1966