Note on Hamilton Circuits

1960/01/01 by Oystein Ore, Öystein Ore · 30 citations
Computer Science · #Computability, Logic, AI Algorithms #Cellular Automata and Applications

paper · doi:10.2307/2308928

Cited by

• Ore-type condition for longest cycles in hypergraphs and bipartite graphs
• On Hamiltonian bipartite graphs
• Sufficient Conditions for Circuits in Graphs †
• On the Number of Acyclic Orientations of Complete k-Partite Graphs
• Transversal Hamilton Paths and Cycles
• Ore's Theorem for rainbow Hamiltonian-connected graphs
• Ore‐type degree conditions for a graph to be H‐linked
• Cycles of given size in a dense graph
• Extending two results on hamiltonian graphs involving the bipartite-hole-number
• Bipartite holes, degree sums and Hamilton cycles
• Projective Ore-Degree Conditions for Intersection Theorems in Vector Spaces
• A survey on Hamilton cycles in directed graphs
• Fractional triangle decompositions in almost complete graphs
• Maxima of the Q-index: forbidden even cycles
• On degree sum conditions for 2-factors with a prescribed number of cycles
• A Classification of Connected f -factor Problems inside NP
• Rainbow structures in a collection of graphs with degree conditions
• Surface embedding of non-bipartite k-extendable graphs
• Local Connectivity, Local Degree Conditions, some Forbidden Induced\n Subgraphs, and Cycle Extendability
• On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs
• Spanning k-ended trees of 3-regular connected graphs
• Hamilton cycles, minimum degree and bipartite holes
• New Ore-type Conditions for Hamilton Cycles and Spanning Trees with few leaves
• A note on triangle-free graphs
• Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
• Scalable Steiner Tree for Multicast Communications in Software-Defined Networking
• An asymptotically tight bound on the Q-index of graphs with forbidden cycles
• Cycle lengths in the percolated hypercube
• On directed version of the Sauer-Spender Theorem
• A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree. [europepmc]