Circuits through specified edges
- 31 December 1982
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 41 (1) , 29-34
- https://doi.org/10.1016/0012-365x(82)90078-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Cycles through specified vertices of a graphCombinatorica, 1981
- Hamilton cycles in regular 2-connected graphsJournal of Combinatorial Theory, Series B, 1980
- A remark on two sufficient conditions for hamilton cyclesDiscrete Mathematics, 1978
- Note on circuits containing specified edgesJournal of Combinatorial Theory, Series B, 1977
- Circuits containing specified edgesJournal of Combinatorial Theory, Series B, 1977
- The binding number of a graph and its Anderson numberJournal of Combinatorial Theory, Series B, 1973
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre UnterteilungenMathematische Nachrichten, 1960