Generalization of Matching Extensions in Graphs (IV): Closures
Authors:
- 4 April 2016
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 32 (5) , 2009-2018
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (CN) (11471257)
- Fundamental Research Funds for the Central Universities
- Natural Sciences and Engineering Research Council of Canada (144073)
This publication has 11 references indexed in Scilit:
- Generalization of matching extensions in graphs (II)Discrete Applied Mathematics, 2007
- Generalization of matching extensions in graphsDiscrete Mathematics, 2001
- Closure and factor-critical graphsDiscrete Mathematics, 2000
- Closure and Hamiltonian-connectivity of claw-free graphsDiscrete Mathematics, 1999
- On a Closure Concept in Claw-Free GraphsJournal of Combinatorial Theory, Series B, 1997
- On k-factor-critical graphsDiscussiones Mathematicae Graph Theory, 1996
- Extending matchings in graphs: A surveyDiscrete Mathematics, 1994
- On n-extendable graphsDiscrete Mathematics, 1980
- A method in graph theoryDiscrete Mathematics, 1976
- Graphs with 1-factorsProceedings of the American Mathematical Society, 1974