Note on Hamilton Circuits
From MaRDI portal
Publication:3264678
DOI10.2307/2308928zbMath0089.39505MaRDI QIDQ3264678
Publication date: 1960
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2308928
Related Items
Old Hamiltonian Ideas from a New Point of View, Unnamed Item, Unnamed Item, Hamiltonian cycles in n‐extendable graphs, Unnamed Item, An Ore-type condition for cyclability, Computation of the 0-dual closure for hamiltonian graphs, No-hole \((r+1)\)-distant colorings, 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, Hamiltonian jump graphs, 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, Cycles through prescribed vertices with large degree sum, Two vertex-disjoint cycles in a graph, Orthogonal \([k-1,k+1\)-factorizations in graphs], Some panconnected and pancyclic properties of graphs with a local Ore-type condition, Extensions and consequences of Chvátal-Erdös' theorem, Sufficient conditions for a graph to be Hamiltonian, On 2-edge-connected \([\mathbf{a,b}\)-factors of graphs with Ore-type condition], Pancyclic graphs. I, On k-path Hamiltonian graphs and line-graphs, Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente, Theory of path length distributions. I, Covering cycles and \(k\)-term degree sums, Ore-type conditions for the existence of even \([2,b\)-factors in graphs], A fan-type condition for cyclability, On Hamiltonian bipartite graphs, Unnamed Item, Stability of arc-transitive graphs, A sufficient condition for 𝑘-path Hamiltonian digraphs, Unnamed Item
