Maximale Kreise in Graphen

DOI10.1007/BF02941215zbMath0469.05045OpenAlexW2047730394MaRDI QIDQ1156816

Norbert Köhler

Publication date: 1981

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02941215

zbMATH Keywords

Hamiltonian graphsmaximal circuits

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

A sufficient condition for a graph to be Hamiltonian

Cites Work

• Arc coverings of graphs
• Hamilton connected graphs
• Note on Hamilton Circuits
• On maximal paths and circuits of graphs
• On Maximal Circuits in Finite Graphs
• A note on K-path hamiltonian graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Maximale Kreise in Graphen