Advances on the Hamiltonian problem -- a survey
From MaRDI portal
Publication:1396651
DOI10.1007/s00373-002-0492-xzbMath1024.05057OpenAlexW2110444610WikidataQ105723826 ScholiaQ105723826MaRDI QIDQ1396651
Publication date: 8 July 2003
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-002-0492-x
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Eulerian and Hamiltonian graphs (05C45)
Related Items
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments, Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy, 2-Trees: Structural insights and the study of Hamiltonian paths, Unnamed Item, Packing spanning trees in highly essentially connected graphs, The Hamiltonian properties in \(K_{1,r}\)-free split graphs, Circumferences of k-connected graphs involving independence numbers, On Hamiltonicity of regular graphs with bounded second neighborhoods, An improved degree based condition for Hamiltonian cycles, Geodesic-pancyclic graphs, Chvátal–Erdős Theorem: Old Theorem with New Aspects, On spanning disjoint paths in line graphs, An efficient condition for a graph to be Hamiltonian, Partitioning a Graph into Highly Connected Subgraphs, Hamilton cycles in digraphs of unitary matrices, Degree sum conditions on two disjoint cycles in graphs, Graph factors and factorization: 1985--2003: a survey, A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole, Unnamed Item, Some local-global phenomena in locally finite graphs, Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs, Polynomially determining spanning connectivity of locally connected line graphs, Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path, Uniformly Connected Graphs — A Survey, Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem, Edge bounds in nonhamiltonian \(k\)-connected graphs, Unnamed Item, Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey, A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path, Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs, Embedding cycles in finite planes, Hamiltonian and long paths in bipartite graphs with connectivity, Hamilton-connected, vertex-pancyclic and bipartite holes, Oriented discrepancy of Hamilton cycles, Hamilton cycles in implicit claw-heavy graphs, Automated conjecturing. III. Property-relations conjectures, On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles, Hamiltonian cycles with all small even chords, Hamilton cycles in highly connected and expanding graphs, A survey on Hamilton cycles in directed graphs, A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence, Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited, The ratio of the numbers of odd and even cycles in outerplanar graphs, 2-factors with the bounded number of components in line graphs, Geodesic pancyclicity of twisted cubes, Group connectivity and group colorings of graphs --- a survey, Distance signless Laplacian spectral radius and Hamiltonian properties of graphs, Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path, Hamiltonicity in Split Graphs - A Dichotomy, Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits, Hamiltonian paths in some classes of grid graphs, On 2-factors with a bounded number of odd components, Recent advances on the Hamiltonian problem: survey III, On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem, Long cycles in Hamiltonian graphs, Signless Laplacian eigenvalues and circumference of graphs, Not being (super)thin or solid is hard: A study of grid Hamiltonicity, On \(s\)-Hamiltonicity of net-free line graphs, HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle, Fault-free mutually independent Hamiltonian cycles of faulty star graphs, Network reliability in Hamiltonian graphs, COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH, Spanning paths and cycles in triangle-free graphs, Minimum degree conditions for \(H\)-linked graphs, On some cycles in Wenger graphs, Relative length of longest paths and longest cycles in triangle-free graphs, On 2-factors with \(k\) components, Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs, \(k\)-Ordered Hamilton cycles in digraphs, A localization method in Hamiltonian graph theory, Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs, Fan type condition and characterization of Hamiltonian graphs, Graph invariants and large cycles: a survey, On degree sum conditions for directed path-factors with a specified number of paths, Pancyclicity of Hamiltonian and highly connected graphs, On a generalization of Chvátal's condition giving new Hamiltonian degree sequences, Hamilton cycles in strong products of graphs, On packing Hamilton cycles in \(\varepsilon\)-regular graphs, A clique-covering sufficient condition for hamiltonicity of graphs, Hamiltonian and long cycles in bipartite graphs with connectivity, Distributing vertices along a Hamiltonian cycle in Dirac graphs, Hamiltonian paths in \(L\)-shaped grid graphs, Long paths and cycles passing through specified vertices under the average degree condition, Forbidden pairs and the existence of a dominating cycle, A new sufficient condition for Hamiltonian graphs, Induced nets and Hamiltonicity of claw-free graphs, Hamiltonicity of 3-arc graphs, Hamiltonian threshold for strong products of graphs, The H-force sets of the graphs satisfying the condition of Ore's theorem, Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs, Unnamed Item, Hamiltonian cycles and dominating cycles passing through a linear forest, Perfect matching dominating cycle — a new dominating cycle, Normal Eulerian clique-covering and hamiltonicity, Dirac's Condition for Spanning Halin Subgraphs, Disjoint Hamiltonian cycles in bipartite graphs, Hamilton cycles and paths in vertex-transitive graphs-current directions, On subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphs, Hamiltonian Extension, Pentagons and cycle coverings, Hamiltonian cycles of power graph of abelian groups, Vertex-transitive graphs that have no Hamilton decomposition, A condition on Hamilton-connected line graphs
