The binding number of a graph and its Anderson number
- 1 December 1973
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 15 (3), 225-255
- https://doi.org/10.1016/0095-8956(73)90038-5
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Tough graphs and hamiltonian circuitsDiscrete Mathematics, 2006
- 1-Faktoren von GraphenMathematische Annalen, 1973
- Matchings in graphsBulletin of the Australian Mathematical Society, 1973
- A Remark on a Graph-Covering Conjecture of D. R. WoodallJournal of the London Mathematical Society, 1973
- Perfect matchings of a graphJournal of Combinatorial Theory, Series B, 1971
- Systems of representativesJournal of Mathematical Analysis and Applications, 1966
- Graphs and matching theoremsDuke Mathematical Journal, 1955
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935