On Hamiltonian Circuits

Cited in

(only showing first 100 items - show all)

Combining tree partitioning, precedence, and incomparability constraints
Circuit double covers in special types of cubic graphs
Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
Longest cycles in 3-connected cubic graphs
Parity results on connected f-factors
Every simple 3-polytype with 34 vertices is Hamiltonian
Random triangulations of the plane
Hamiltonicity and combinatorial polyhedra
The smallest 2-connected cubic bipartite planar nonhamiltonian graph
Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons
Shortness exponents for polytopes which are k-gonal modulo n
Submaps of maps. II: Cyclically k-connected planar cubic maps
On Hamiltonian polygons
Pairs of Hamiltonian circuits in 5-connected planar graphs
Hamiltonian circuits in polytopes with even sided faces
Développements recents de la théorie des graphes
Geometric coloring theory
Hamiltonian circuits in prisms over certain simple 3-polytopes
Planar cubic hypohamiltonian and hypotraceable graphs
Spanning cycles of nearly cubic graphs
Bicubic planar maps
On edge-hamiltonian Cayley graphs
Polyhedral graphs without Hamiltonian cycles
The structure of transform graphs
Independent dominating sets and a second hamiltonian cycle in regular graphs
2-factor Hamiltonian graphs.
Vertices of small degree in uniquely Hamiltonian graphs
Grinberg's criterion
Cuts in matchings of 3-connected cubic graphs
Hamiltonicity in locally finite graphs: two extensions and a counterexample
Hamilton cycles in infinite cubic graphs
Circumference of 3-connected cubic graphs
Dual power assignment via second Hamiltonian cycle
Hamiltonian tetrahedralizations with Steiner points
Long cycles in Hamiltonian graphs
On hypohamiltonian graphs
Hamiltonian simple polytopes
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 maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges
Solving the optimum communication spanning tree problem
The contributions of W.T. Tutte to matroid theory
A PPA parity theorem about trees in a bipartite graph
On the expected number of perfect matchings in cubic planar 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
The product of two high-frequency graph Laplacian eigenfunctions is smooth
Cycles containing all the odd-degree vertices
A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three
A counterexample to prism-Hamiltonicity of 3-connected planar graphs
Distance-two colourings of Barnette graphs
A parity theorem about trees with specified degrees
Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs
Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs
On the minimum leaf number of cubic graphs
Highly-connected planar cubic graphs with few or many Hamilton cycles
Regular non-Hamiltonian polyhedral graphs
4-connected projective-planar graphs are Hamiltonian-connected
On uniquely Hamiltonian claw-free and triangle-free graphs
A travelling salesman problem (TSP) with multiple job facilities.
A two-connected planar graph without concurrent longest paths
Hamiltonian circuits on simple 3-polytopes
Hamiltonian circuits in certain prisms
On the circumference of 3-connected cubic triangle-free plane graphs
Dual circumference and collinear sets
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
On the number of Hamiltonian cycles in bipartite graphs
Uniquely Hamiltonian graphs of minimum degree 4
Cycle double covers in cubic graphs having special structures
On Sheehan's Conjecture for Graphs with Symmetry
Balancing two spanning trees
Upper Bound Constructions for Untangling Planar Geometric Graphs
A Theorem on Planar Graphs
A non-Hamiltonian planar graph
On perfectly one–factorable cubic graphs
5-Connected Toroidal Graphs are Hamiltonian-Connected
On r-regular r-connected non-hamiltonian graphs
Vertex-arboricity of planar graphs without intersecting triangles
The complexity of Thomason's algorithm for finding a second Hamiltonian cycle
Spanning closed walks and TSP in 3-connected planar graphs
On the minimum number of Hamiltonian cycles in regular graphs
A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing
\(4\)-regular \(4\)-connected Hamiltonian graphs with a bounded number of Hamiltonian cycles
Regular graphs with few longest cycles
The minimality of the Georges-Kelmans graph
Dual circumference and collinear sets
scientific article; zbMATH DE number 7559398 (Why is no real title available?)
Cycles of many lengths in Hamiltonian graphs
Graphs with few Hamiltonian cycles
On hypohamiltonian and almost hypohamiltonian graphs
TSP tours in cubic graphs: beyond 4/3
Planar digraphs without large acyclic sets
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
B-sets and coloring problems
Polytopes, graphs, and complexes
Spanning closed walks and TSP in 3-connected planar graphs
On Finding Hamiltonian Cycles in Barnette Graphs
Long cycles in fullerene graphs

This page was built for publication: On Hamiltonian Circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5837977)