Computing the binding number of a graph
- 30 June 1990
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 27 (3) , 283-285
- https://doi.org/10.1016/0166-218x(90)90072-k
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- Optimal attack and reinforcement of a networkJournal of the ACM, 1985
- The binding number of a graph and its Anderson numberJournal of Combinatorial Theory, Series B, 1973
- Tough graphs and hamiltonian circuitsDiscrete Mathematics, 1973
- Perfect matchings of a graphJournal of Combinatorial Theory, Series B, 1971