A note on Hamiltonian split graphs
- 1 April 1980
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 28 (2) , 245-248
- https://doi.org/10.1016/0095-8956(80)90069-6
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Disjoint matchings of graphsJournal of Combinatorial Theory, Series B, 1977
- Aggregation of Inequalities in Integer ProgrammingPublished by Elsevier ,1977
- Edmonds polytopes and weakly hamiltonian graphsMathematical Programming, 1973