Maximale Kreise in Graphen

DOI10.1007/BF02941215MaRDI QIDQ1156816zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(1)

• A sufficient condition for a graph to be Hamiltonian

This page was built for publication: Maximale Kreise in Graphen

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156816)