Cited in
(only showing first 100 items - show all)- On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles
- Spanning \(k\)-ended trees of bipartite graphs
- A closure concept based on neighborhood unions of independent triples
- The hidden algorithm of Ore's theorem on Hamiltonian cycles
- Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
- On the degrees of a strongly vertex-magic graph
- Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
- Toughness in graphs -- a survey
- Energy conditions for Hamiltonicity of graphs
- Hamiltonicity of 4-connected graphs
- The k-dominating cycles in graphs
- Fractional matching preclusion number of graphs
- Removable matchings and Hamiltonian cycles
- Vertex degree sums for perfect matchings in 3-uniform hypergraphs
- 2-Trees: Structural insights and the study of Hamiltonian paths
- Closures and heavy pairs for Hamiltonicity
- On degree sum conditions for long cycles and cycles through specified vertices
- Disjoint cycles with partial degree conditions in claw-free graphs
- Vertex pancyclic graphs
- A degree sum condition with connectivity for relative length of longest paths and cycles
- Graphs containing every 2-factor
- An Ore-type analogue of the Sauer-Spencer theorem
- Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths
- Degree sum conditions for the circumference of 4-connected graphs
- Long cycles in graphs and digraphs
- Vertex degree sums for matchings in 3-uniform hypergraphs
- On Hamiltonian bipartite graphs
- Computation of the 0-dual closure for hamiltonian graphs
- Pancyclic graphs and a conjecture of Bondy and Chvatal
- No-hole (r+1)-distant colorings
- HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle
- Hamiltonicity of claw-free graphs and Fan-type conditions
- Closure and spanning trees with bounded total excess
- Ramsey number of paths and connected matchings in Ore-type host graphs
- Hamiltonism, degree sum and neighborhood intersections
- A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
- 2-proper partition of a graph
- Results and problems on chorded cycles: a survey
- Partial degree conditions and cycle coverings in bipartite graphs
- New sufficient conditions for bipancyclic bipartite graphs
- Hamiltonian extension
- Edge disjoint caterpillar realizations
- Vertex degree sums for matchings in 3-uniform hypergraphs
- Spanning paths in graphs
- New invariants for partitioning a graph into 2-connected subgraphs
- Maximum graphs non-Hamiltonian-connected from a vertex
- Hamiltonian cycles in n‐extendable graphs
- Ramsey-Turán type results for matchings in edge colored graphs
- Old Hamiltonian Ideas from a New Point of View
- On (2, k)-Hamilton-connected graphs
- Locally pancyclic graphs
- A generalization of Ore's Theorem involving neighborhood unions
- Closures, cycles, and paths
- A note on spanning trees with a specified degree sequence
- On a neighborhood condition implying the existence of disjoint complete graphs
- Degree sum and graph linkage with prescribed path lengths
- Hamiltonian cycles with all small even chords
- Spanning cycles through specified edges in bipartite graphs
- Spectral radius and Hamiltonicity of graphs
- Heavy subgraphs, stability and Hamiltonicity
- Degree with neighborhood conditions and highly Hamiltonian graphs
- Vertex pancyclicity and new sufficient conditions
- A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On a Goodman-Hedetniemi sufficient condition for graph Hamiltonicity
- Embedding graphs having Ore-degree at most five
- Maxima of the Q-index: forbidden rainbow Hamilton paths, matchings and linear forests
- A localization method in Hamiltonian graph theory
- On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
- A fan-type condition for cyclability
- Spectral radius and Hamiltonicity of graphs
- Recent advances on the Hamiltonian problem: survey III
- More powerful closure operations on graphs
- Ore-type and Dirac-type theorems for matroids
- Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups
- Long antipaths and anticycles in oriented graphs
- A note on the computation on the k-closure of a graph
- A condition for a Hamiltonian bipartite graph to be bipancyclic
- Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
- Partitioning a graph into highly connected subgraphs
- Endpoint extendable paths in dense graphs
- Spanning trees with small degrees and few leaves
- On degree sum conditions for directed path-factors with a specified number of paths
- Placing specified vertices at precise locations on a Hamiltonian cycle
- Ore-type condition for Hamilton -cycle in k-uniform hypergraphs
- Extending cycles in graphs
- Orthogonal \([k-1,k+1]\)-factorizations in graphs
- Interplays between variations of arbitrarily partitionable graphs under minimality constraints
- Signless Laplacian spectral radius and Hamiltonicity
- On degree conditions of semi-balanced k-partite Hamiltonian graphs
- Vertex pancyclicity over lexicographic products
- A new sufficient condition for Hamiltonian graphs
- Proof of a conjecture of Haeggkvist on cycles and independent edges
- Partitions of a graph into paths with prescribed endvertices and lengths
- The H-force sets of the graphs satisfying the condition of Ore's theorem
- Progress on sufficient conditions for a graph to have a spanning \(k\)-ended tree
- A _3 condition for arbitrarily partitionable graphs
- A note on minimum degree, bipartite holes, and Hamiltonian properties
- Edge degree conditions for dominating and spanning closed trails
- Minimum degree and size conditions for the proper connection number of 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)
