On the public citation graph

Graphs with few hamiltonian cycles

0 signed · 41 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1097-0118(199902)30:2<137::aid-jgt7>3.0.co;2-gopenalex-snapshot
Fast generation of regular graphs and construction of cages
inferredcites →https://doi.org/10.1002/jgt.20205openalex-snapshot
Independent dominating sets and hamiltonian cycles
inferredcites →https://doi.org/10.1002/jgt.21729openalex-snapshot
Uniquely Hamiltonian Graphs of Minimum Degree 4
inferredcites →https://doi.org/10.1002/jgt.22125openalex-snapshot
Generation of Cubic Graphs and Snarks with Large Girth
inferredcites →https://doi.org/10.1002/jgt.3190010110openalex-snapshot
Graphs with exactly one hamiltonian circuit
inferredcites →https://doi.org/10.1002/jgt.3190050313openalex-snapshot
A census of maximum uniquely hamiltonian graphs
inferredcites →https://doi.org/10.1006/jagm.1997.0898openalex-snapshot
Isomorph-Free Exhaustive Generation
inferredcites →https://doi.org/10.1006/jctb.1997.1794openalex-snapshot
Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs
inferredcites →https://doi.org/10.1006/jctb.1998.1845openalex-snapshot
Vertices of Small Degree in Uniquely Hamiltonian Graphs
inferredcites →https://doi.org/10.1007/978-3-540-73086-6_12openalex-snapshot
The On-Line Encyclopedia of Integer Sequences
inferredcites →https://doi.org/10.1007/bf02392606openalex-snapshot
Die Theorie der regulären graphs
inferredcites →https://doi.org/10.1007/s00373-006-0666-zopenalex-snapshot
A Degree Constraint for Uniquely Hamiltonian Graphs
inferredcites →https://doi.org/10.1016/0095-8956(80)90087-8openalex-snapshot
Spanning cycles of nearly cubic graphs
inferredcites →https://doi.org/10.1016/0095-8956(81)90089-7openalex-snapshot
Planar cubic hypohamiltonian and hypotraceable graphs
inferredcites →https://doi.org/10.1016/0095-8956(89)90064-6openalex-snapshot
Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
inferredcites →https://doi.org/10.1016/j.dam.2012.07.018openalex-snapshot
House of Graphs: A database of interesting graphs
inferredcites →https://doi.org/10.1016/j.disc.2019.111608openalex-snapshot
Highly-connected planar cubic graphs with few or many Hamilton cycles
inferredcites →https://doi.org/10.1016/j.jsc.2013.09.003openalex-snapshot
Practical graph isomorphism, II
inferredcites →https://doi.org/10.1016/s0167-5060(08)70511-9openalex-snapshot
Hamiltonian Cycles and Uniquely Edge Colourable Graphs
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1017/s0963548300002182openalex-snapshot
On the Number of Hamiltonian Cycles in Bipartite Graphs
inferredcites →https://doi.org/10.1080/10586458.2017.1306813openalex-snapshot
On the Minimum Number of Hamiltonian Cycles in Regular Graphs
inferredcites →https://doi.org/10.1112/jlms/s1-21.2.98openalex-snapshot
On Hamiltonian Circuits
inferredcites →https://doi.org/10.46298/dmtcs.551openalex-snapshot
Generation of Cubic graphs
inferredcites →https://doi.org/10.7151/dmgt.1784openalex-snapshot
On uniquely Hamiltonian claw-free and triangle-free graphs
inferredcites →https://doi.org/10.7155/jgaa.00091openalex-snapshot
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.23057openalex-snapshot
K2‐Hamiltonian graphs: II
inferred← citeshttps://doi.org/10.1007/978-3-030-57197-9_9openalex-snapshot
New Algorithms for Bipolar Single-Valued Neutrosophic Hamiltonian Cycle
inferred← citeshttps://doi.org/10.1007/s10601-021-09323-8openalex-snapshot
Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs
inferred← citeshttps://doi.org/10.1007/s12190-021-01513-0openalex-snapshot
On interval transmission irregular graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2020.125233openalex-snapshot
A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three
inferred← citeshttps://doi.org/10.1016/j.dam.2024.05.021openalex-snapshot
Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111608openalex-snapshot
Highly-connected planar cubic graphs with few or many Hamilton cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112963openalex-snapshot
Switching 3-edge-colorings of cubic graphs
inferred← citeshttps://doi.org/10.1090/mcom/3943openalex-snapshot
Few hamiltonian cycles in graphs with one or two vertex degrees
inferred← citeshttps://doi.org/10.1109/access.2023.3312129openalex-snapshot
Review and Assessment of Digital Twin–Oriented Social Network Simulators
inferred← citeshttps://doi.org/10.1137/21m1414048openalex-snapshot
Regular Graphs with Few Longest Cycles
inferred← citeshttps://doi.org/10.2197/ipsjjip.28.876openalex-snapshot
Randomized Reductions and the Topology of Conjectured Classes of Uniquely Hamiltonian Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2104.06347openalex-snapshot
4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles
inferred← citeshttps://doi.org/10.7151/dmgt.2514openalex-snapshot
On non-hamiltonian polyhedra without cubic vertices and their vertex-deleted subgraphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.