Random near-regular graphs and the node packing problem
- 31 December 1985
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 4 (4) , 169-174
- https://doi.org/10.1016/0167-6377(85)90024-0
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Maximum matchings in a class of random graphsJournal of Combinatorial Theory, Series B, 1986
- An exact threshold theorem for random graphs and the node-packing problemJournal of Combinatorial Theory, Series B, 1986
- Hamiltonian cycles in random regular graphsJournal of Combinatorial Theory, Series B, 1984
- On the existence of Hamiltonian cycles in a class of random graphsDiscrete Mathematics, 1983
- Almost all Regular Graphs are HamiltonianEuropean Journal of Combinatorics, 1983
- On the connectivity of randomm-orientable graphs and digraphsCombinatorica, 1982
- A random graphJournal of Applied Probability, 1981
- Minimum node covers and 2-bicritical graphsMathematical Programming, 1979
- On the integer-valued variables in the linear vertex packing problemMathematical Programming, 1977
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975