Note on Hamilton Circuits

Cited in

(only showing first 100 items - show all)

Ore-type versions of Brooks' theorem
A new sufficient condition for Hamiltonian graphs
Removable matchings and Hamiltonian cycles
Pancyclic graphs and linear forests
A degree sum condition concerning the connectivity and the independence number of a graph
Hamiltonian cycles and dominating cycles passing through a linear forest
Hamilton cycles in claw-heavy graphs
Degree condition for the existence of a k-factor containing a given Hamiltonian cycle
Degree conditions for the partition of a graph into cycles, edges and isolated vertices
Degree conditions and degree bounded trees
A degree condition implying that every matching is contained in a Hamiltonian cycle
On the spanning fan-connectivity of graphs
A comprehensive analysis of degree based condition for Hamiltonian cycles
On Hamiltonian cycles and Hamiltonian paths
Disjoint Hamiltonian cycles in bipartite graphs
Trees through specified vertices
Dirac's type sufficient conditions for hamiltonicity and pancyclicity
A degree sum condition for graphs to be prism Hamiltonian
Ore-type and Dirac-type theorems for matroids
Signless Laplacian spectral radius and Hamiltonicity
Connected graphs as subgraphs of Cayley graphs: conditions on hamiltonicity
Hamilton cycles and paths in vertex-transitive graphs-current directions
Ore-type conditions implying 2-factors consisting of short cycles
A look at cycles containing specified elements of a graph
On the circumference of a graph and its complement
A degree sum condition with connectivity for relative length of longest paths and cycles
On the extremal number of edges in Hamiltonian connected graphs
Proof of a conjecture of Haeggkvist on cycles and independent edges
On k-leaf-connected graphs
A note on the computation on the k-closure of a graph
Neighbourhood unions and Hamiltonian properties in graphs
Minimum graphs with complete k-closure
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\)
Existence of dominating cycles and paths
More powerful closure operations on graphs
Hamiltonism, degree sum and neighborhood intersections
Stable properties of graphs
An Ore-type condition for the existence of \(k\)-factors in graphs
Hamiltonian properties of graphs with large neighborhood unions
A condition for a Hamiltonian bipartite graph to be bipancyclic
Neighborhood unions and a generalization of Dirac's theorem
Hamiltonian graphs involving neighborhood intersections
Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
A method in graph theory
Panconnected graphs. II
An Ore-type condition implying a digraph to be pancyclic
A remark on two sufficient conditions for Hamilton cycles
Some Ore-type conditions for the existence of connected \([2,k]\)-factors in graphs
Locally pancyclic graphs
A closure concept based on neighborhood unions of independent triples
A generalization of Ore's Theorem involving neighborhood unions
A degree characterisation of pancyclicity
Extremal problems and generalized degrees
Extending matchings in graphs: A survey
Subgraphs, closures and hamiltonicity
Neighborhood unions and Hamiltonian properties
A proof of a conjecture about \(D_ \lambda\)-paths in graphs with large neighborhood unions
Dirac's minimum degree condition restricted to claws
A generalization of Bondy's and Fan's sufficient conditions for Hamiltonian graphs
Small cycles in Hamiltonian graphs
Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
The hidden algorithm of Ore's theorem on Hamiltonian cycles
Pancyclic graphs and a conjecture of Bondy and Chvatal
2-factors and Hamiltonicity
Vertex pancyclic graphs
On one extension of Dirac's theorem on Hamiltonicity
Degree sum conditions on two disjoint cycles in graphs
Extremal problems on the Hamiltonicity of claw-free graphs
On degree sum conditions for 2-factors with a prescribed number of cycles
Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path
Hamiltonian numbers in oriented graphs
On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles
Leaf number and Hamiltonian \(C_4\)-free graphs
Strong matching preclusion number of graphs
Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
Conditions for graphs to be path partition optimal
The existence of \(f\)-forests and \(f\)-trees in graphs
HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle
Spanning paths in graphs
Hamiltonicity of claw-free graphs and Fan-type conditions
Degree sum and graph linkage with prescribed path lengths
Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
Covering a graph with cycles of length at least 4
Chorded pancyclicity in \(k\)-partite graphs
Enomoto and Ota's conjecture holds for large graphs
Extending vertex and edge pancyclic graphs
One sufficient condition for Hamiltonian graphs involving distances
Hamiltonian jump graphs
Selecting and covering colored points
A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
Degree sums, \(k\)-factors and Hamilton cycles in graphs
Neighborhood unions and cyclability of graphs
On \(k\)-ordered graphs involved degree sum
Spanning spiders and light-splitting switches
New sufficient conditions for bipancyclic bipartite graphs
A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs
Hamiltonicity in balanced \(k\)-partite graphs

This page was built for publication: Note on Hamilton Circuits

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