Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
On the Problem of Relative Components of Minimal Graphs Read chapter Read first chapter

1990 | OriginalPaper | Chapter

On the Coupling Condition and Hamiltonicity

Authors : C. Hoede, H. J. Smit

Published in: Topics in Combinatorics and Graph Theory

Publisher: Physica-Verlag HD

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

previous chapter Extending Hall’s Theorem
next chapter Transversals and Matroids
Metadata
Title
On the Coupling Condition and Hamiltonicity
Authors
C. Hoede
H. J. Smit
Copyright Year
1990
Publisher
Physica-Verlag HD
Book
Topics in Combinatorics and Graph Theory

Print ISBN: 978-3-642-46910-7

Electronic ISBN: 978-3-642-46908-4

Copyright Year: 1990

DOI
https://doi.org/10.1007/978-3-642-46908-4_42

Premium Partner

    Image Credits