On Maximal Circuits in Finite Graphs

Cited in

(45)

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

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

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