On Maximal Circuits in Finite Graphs

DOI10.1016/S0167-5060(08)70503-XzbMath0399.05039OpenAlexW1801255175MaRDI QIDQ4182545

Heinz A. Jung

Publication date: 1978

Published in: Advances in Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70503-x

zbMATH Keywords

HamiltonianMaximal Circuits Infinite Graphs

Mathematics Subject Classification ID

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

Related Items (41)

Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion ⋮ On one extension of Dirac's theorem on Hamiltonicity ⋮ Toughness, degrees and 2-factors ⋮ Hamiltonian cycles in n‐extendable graphs ⋮ Long cycles in graphs with prescribed toughness and minimum degree ⋮ Hamiltonian degree conditions for tough graphs ⋮ 1-tough cocomparability graphs are hamiltonian ⋮ Some local-global phenomena in locally finite graphs ⋮ The vertex attack tolerance of complex networks ⋮ A note on dominating cycles in 2-connected graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ \(k\)-factors and Hamilton cycles in graphs ⋮ A Remark on Hamiltonian Cycles ⋮ On agglomeration-based rupture degree in networks and a heuristic algorithm ⋮ On path-coverings and Hamilton-connectivity of finite graphs ⋮ An Ore-type condition for hamiltonicity in tough graphs and the extremal examples ⋮ A closure lemma for tough graphs and Hamiltonian degree conditions ⋮ A sufficient condition for a graph to be Hamiltonian ⋮ Maximale Kreise in Graphen ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS ⋮ Recognizing tough graphs is NP-hard ⋮ A simple proof of a theorem of Jung ⋮ Note on 2-connected graphs with \(d(u)+d(v)\geq n-4\) ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Hamiltonian properties of graphs with large neighborhood unions ⋮ Maximum nonhamiltonian tough graphs ⋮ Graph invariants and large cycles: a survey ⋮ Toughness in graphs -- a survey ⋮ New local conditions for a graph to be Hamiltonian ⋮ A vulnerability parameter of networks ⋮ Über Hamiltonsche Kreise und unabhängige Ecken in Graphen ⋮ The neighbour-scattering number can be computed in polynomial time for interval graphs ⋮ Long cycles in graphs with large degree sums ⋮ Unnamed Item ⋮ An Ore-type condition for Hamiltonicity in tough graphs ⋮ Hamiltonian cycles in 1-tough graphs ⋮ Berge cycles in non-uniform hypergraphs ⋮ An Ore-type condition for the existence of two disjoint cycles ⋮ Long cycles, degree sums and neighborhood unions ⋮ All nonhamiltonian tough graphs satisfying a 3-degree sum and Fan-type conditions

This page was built for publication: On Maximal Circuits in Finite Graphs