Abstract
The coupling condition is a necessary and sufficient condition for a graph to be hamiltonian. It is shown that the condition also applies to directed graphs and hypergraphs.
| Original language | English |
|---|---|
| Title of host publication | Topics in Combinatorics and Graph theory |
| Subtitle of host publication | Essays in Honour of Gerhard Ringel |
| Editors | Rainer Bodendiek, Rudolf Henn |
| Place of Publication | Heidelberg |
| Publisher | Physica-Verlag |
| Pages | 373-380 |
| Number of pages | 13 |
| ISBN (Electronic) | 978-3-642-46908-4 |
| ISBN (Print) | 978-3-7908-0439-3, 978-3-642-46910-7 |
| DOIs | |
| Publication status | Published - 1990 |
Keywords
- Contact point
- Directed graph
- Undirected graph
- Hamilton cycle
- Coupling condition
Fingerprint
Dive into the research topics of 'On the coupling condition and hamiltonicity'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver