A note on Hamiltonian circuits
From MaRDI portal
Publication:2551113
DOI10.1016/0012-365X(72)90079-9zbMath0233.05123OpenAlexW2069905179WikidataQ59699135 ScholiaQ59699135MaRDI QIDQ2551113
Publication date: 1972
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(72)90079-9
Related Items (only showing first 100 items - show all)
Forbidden pairs of disconnected graphs for traceability in connected graphs ⋮ Pancyclic BIBD block-intersection graphs ⋮ A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity ⋮ A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs ⋮ Spanning spiders and light-splitting switches ⋮ CYCLES IN TRIANGLE-FREE GRAPHS ⋮ Closures, cycles, and paths ⋮ A note on pancyclism of highly connected graphs ⋮ On paths and cycles through specified vertices ⋮ Spanning trails with variations of Chvátal-Erdős conditions ⋮ Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs ⋮ Circumferences of k-connected graphs involving independence numbers ⋮ Long cycles in graphs with prescribed toughness and minimum degree ⋮ On the 3-color Ramsey numbers \(R(C_4,C_4,W_n)\) ⋮ Degree sums and spanning brooms of a graph ⋮ Generalized Turán number for linear forests ⋮ A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs ⋮ Constructing featured supereulerian graph ⋮ Sufficient conditions for a graph to have all \([a, b\)-factors and \((a, b)\)-parity factors] ⋮ Chvátal–Erdős Theorem: Old Theorem with New Aspects ⋮ Nowhere-zero 3-flows of graphs with independence number two ⋮ Independent sets, cliques and hamiltonian graphs ⋮ Hamiltonian extendable graphs ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ The neighborhood union of independent sets and hamiltonicity of graphs ⋮ Minimum degree, independence number and regular factors ⋮ Bipartite independent number and Hamilton-biconnectedness of bipartite graphs ⋮ Supereulerian graphs with constraints on the matching number and minimum degree ⋮ Some local-global phenomena in locally finite graphs ⋮ Long cycles through specified vertices ⋮ The Chvátal-Erdös condition for cycles in triangle-free graphs ⋮ Degree sums and proper connection number of graphs ⋮ Independence number in \(n\)-extendable graphs ⋮ Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs ⋮ On Saito's conjecture and the Oberly-Sumner conjectures ⋮ Extensions and consequences of Chvátal-Erdös' theorem ⋮ An implicit degree sum condition for cycles through specified vertices ⋮ The Chvátal-Erdős condition for prism-Hamiltonicity ⋮ A note on Hamiltonian cycles in 4-tough \((P_2 \cup KP_1)\)-free graphs ⋮ Cycles of many lengths in Hamiltonian graphs ⋮ Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity ⋮ Neighborhood unions and extremal spanning trees ⋮ On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs ⋮ Non-empty intersection of longest paths in \(H\)-free graphs ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs ⋮ Chvátal-Erdős conditions and almost spanning trails ⋮ Large cycles in large labelled graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity ⋮ Circumference of a graph and its distance dominating longest cycles ⋮ On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs ⋮ Degree sums and dominating cycles ⋮ The longest cycle problem is polynomial on interval graphs ⋮ Matching and spanning trails in digraphs ⋮ The optimal proper connection number of a graph with given independence number ⋮ A note on the independence number, connectivity and \(k\)-ended tree ⋮ Multipartite tournaments: a survey ⋮ On cut vertices and eigenvalues of character graphs of solvable groups ⋮ Generalizations of the classics to spanning connectedness ⋮ On the Thomassen's conjecture ⋮ Random regular graphs of high degree ⋮ A localization method in Hamiltonian graph theory ⋮ An extension of the Win theorem: counting the number of maximum independent sets ⋮ Positional games on random graphs ⋮ The Chvátal-Erdős condition for group connectivity in graphs ⋮ Toughness in graphs -- a survey ⋮ On cycles through specified vertices ⋮ Every connected, locally connected nontrivial graph with no induced claw is hamiltonian ⋮ Hamilton connectedness and the partially square graphs ⋮ Tough graphs and Hamiltonian circuits. (Reprint) ⋮ Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint) ⋮ A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs ⋮ Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey ⋮ Spanning k-tree with specified vertices ⋮ Additive patterns in multiplicative subgroups ⋮ Graph methods for solving the unconstrained and constrained optimal assignment problem for locomotives on a single-line railway section ⋮ Various results on the toughness of graphs ⋮ Supereulerian Digraphs with Large Arc-Strong Connectivity ⋮ Supereulerian 3-path-quasi-transitive digraphs ⋮ The independence number condition for the existence of a spanning f-tree ⋮ Random graph's Hamiltonicity is strongly tied to its minimum degree ⋮ Transformation graph \(G^{-+-}\) ⋮ Degree condition for a digraph to be supereulerian ⋮ On the independence number of traceable 2-connected claw-free graphs ⋮ Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs ⋮ Tough graphs and Hamiltonian circuits. ⋮ Cycle Extensions in BIBD Block-Intersection Graphs ⋮ Spanning trails in a 2-connected graph ⋮ Sufficient Conditions for a Digraph to be Supereulerian ⋮ Partitioning a graph into a cycle and a sparse graph ⋮ The maximum size of a nonhamiltonian graph with given order and connectivity ⋮ On size multipartite Ramsey numbers for stars versus paths and cycles ⋮ Large degree vertices in longest cycles of graphs II ⋮ Improved sufficient conditions for Hamiltonian properties ⋮ Wheel and star-critical Ramsey numbers for quadrilateral ⋮ Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs ⋮ Spectrum of Johnson graphs ⋮ An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets ⋮ A condition on Hamilton-connected line graphs
Cites Work
This page was built for publication: A note on Hamiltonian circuits
