On Hamiltonian Circuits
From MaRDI portal
Publication:5837977
DOI10.1112/jlms/s1-21.2.98zbMath0061.41306OpenAlexW1995621089WikidataQ55880634 ScholiaQ55880634MaRDI QIDQ5837977
Publication date: 1946
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s1-21.2.98
Related Items (only showing first 100 items - show all)
Parity results on connected f-factors ⋮ On edge-hamiltonian Cayley graphs ⋮ Every simple 3-polytype with 34 vertices is Hamiltonian ⋮ Grinberg's criterion ⋮ Cuts in matchings of 3-connected cubic graphs ⋮ 5-Connected Toroidal Graphs are Hamiltonian-Connected ⋮ Hamiltonian simple polytopes ⋮ Regular Graphs with Few Longest Cycles ⋮ The minimality of the Georges–Kelmans graph ⋮ Cycle Double Covers in Cubic Graphs having Special Structures ⋮ Hamiltonicity in locally finite graphs: two extensions and a counterexample ⋮ Hamilton cycles in infinite cubic graphs ⋮ Random triangulations of the plane ⋮ Polyhedral graphs without Hamiltonian cycles ⋮ 5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one ⋮ A nonhamiltonian five-regular multitriangular polyhedral graph ⋮ The structure of transform graphs ⋮ Cycles containing all the odd-degree vertices ⋮ On semiextensions and circuit double covers ⋮ THE COMPLEXITY OF THOMASON’S ALGORITHM FOR FINDING A SECOND HAMILTONIAN CYCLE ⋮ On the circumference of 3-connected cubic triangle-free plane graphs ⋮ A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three ⋮ Independent dominating sets and a second hamiltonian cycle in regular graphs ⋮ Circumference of 3-connected cubic graphs ⋮ On Sheehan's Conjecture for Graphs with Symmetry ⋮ Upper Bound Constructions for Untangling Planar Geometric Graphs ⋮ Dual power assignment via second Hamiltonian cycle ⋮ Dual circumference and collinear sets ⋮ Decomposing plane cubic graphs ⋮ Vertex-arboricity of planar graphs without intersecting triangles ⋮ Hamiltonian tetrahedralizations with Steiner points ⋮ Hamiltonicity and combinatorial polyhedra ⋮ 2-factor Hamiltonian graphs. ⋮ 4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles ⋮ Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ The smallest 2-connected cubic bipartite planar nonhamiltonian graph ⋮ Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons ⋮ On some conjectures on cubic 3-connected graphs ⋮ Long cycles in Hamiltonian graphs ⋮ Edge reductions in cyclically \(k\)-connected cubic graphs ⋮ Spanning closed walks and TSP in 3-connected planar graphs ⋮ Shortness exponents for polytopes which are k-gonal modulo n ⋮ A non-Hamiltonian planar graph ⋮ A counterexample to prism-Hamiltonicity of 3-connected planar graphs ⋮ A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing ⋮ Distance-two colourings of Barnette graphs ⋮ The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges ⋮ A parity theorem about trees with specified degrees ⋮ A travelling salesman problem (TSP) with multiple job facilities. ⋮ On the Minimum Number of Hamiltonian Cycles in Regular Graphs ⋮ Solving the optimum communication spanning tree problem ⋮ The contributions of W.T. Tutte to matroid theory ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ Submaps of maps. II: Cyclically \(k\)-connected planar cubic maps ⋮ On Hamiltonian polygons ⋮ A Theorem on Planar Graphs ⋮ A note on 3-connected cubic planar graphs ⋮ Pairs of Hamiltonian circuits in 5-connected planar graphs ⋮ Hamiltonian circuits in polytopes with even sided faces ⋮ What is on his mind? ⋮ Splits of circuits ⋮ Développements recents de la théorie des graphes ⋮ On the Number of Hamiltonian Cycles in Bipartite Graphs ⋮ Geometric coloring theory ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs ⋮ Hamiltonian circuits in prisms over certain simple 3-polytopes ⋮ Multiple Hamilton cycles in bipartite cubic graphs: an algebraic method ⋮ Planar cubic hypohamiltonian and hypotraceable graphs ⋮ Spanning cycles of nearly cubic graphs ⋮ Balancing two spanning trees ⋮ Combining tree partitioning, precedence, and incomparability constraints ⋮ On the relationship between the genus and the cardinality of the maximum matchings of a graph ⋮ Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs ⋮ A PPA parity theorem about trees in a bipartite graph ⋮ On r-regular r-connected non-hamiltonian graphs ⋮ Vertices of small degree in uniquely Hamiltonian graphs ⋮ A two-connected planar graph without concurrent longest paths ⋮ Hamiltonian circuits on simple 3-polytopes ⋮ On the expected number of perfect matchings in cubic planar graphs ⋮ On the minimum leaf number of cubic graphs ⋮ Hamiltonian circuits in certain prisms ⋮ Circuit double covers in special types of cubic graphs ⋮ Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles ⋮ Highly-connected planar cubic graphs with few or many Hamilton cycles ⋮ Bicubic planar maps ⋮ On hypohamiltonian graphs ⋮ Regular non-Hamiltonian polyhedral graphs ⋮ On the Hamiltonian property hierarchy of 3-connected planar graphs ⋮ Tutte paths and long cycles in circuit graphs ⋮ Matching theory and Barnette's conjecture ⋮ 4-connected projective-planar graphs are Hamiltonian-connected ⋮ On uniquely Hamiltonian claw-free and triangle-free graphs ⋮ Hamiltonian cycles in cubic 3-connected bipartite planar graphs ⋮ On perfectly one–factorable cubic graphs ⋮ The number of cycles in 2-factors of cubic graphs ⋮ The product of two high-frequency graph Laplacian eigenfunctions is smooth ⋮ Uniquely Hamiltonian Graphs of Minimum Degree 4 ⋮ Longest cycles in 3-connected cubic graphs
This page was built for publication: On Hamiltonian Circuits
