On the public citation graph
Generation of Cubic graphs
0 signed · 61 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.
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.
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(199610)23:2<139::aid-jgt5>3.0.co;2-uopenalex-snapshot
Fast generation of cubic graphs
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.1006/jagm.1997.0898openalex-snapshot
Isomorph-Free Exhaustive Generation
inferredcites →https://doi.org/10.1007/3-540-28991-7_4openalex-snapshot
Isomorph-Free Exhaustive Generation
inferredcites →https://doi.org/10.1007/bf02579144openalex-snapshot
Automorphisms of random graphs with specified vertices
inferredcites →https://doi.org/10.1007/bf03015696openalex-snapshot
Sur les configurations planes dont chaque point supporte deux droites
inferredcites →https://doi.org/10.1016/0095-8956(77)90034-xopenalex-snapshot
Cubic graphs on ≤14 vertices
inferredcites →https://doi.org/10.1016/j.dam.2008.03.020openalex-snapshot
Graph structural properties of non-Yutsis graphs allowing fast recognition
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)70712-xopenalex-snapshot
On Some Enumeration Problems in Graph Theory
inferredcites →https://doi.org/10.1017/cbo9780511721335.010openalex-snapshot
Models of Random Regular Graphs
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.22125openalex-snapshot
Generation of Cubic Graphs and Snarks with Large Girth
inferred← citeshttps://doi.org/10.1002/jgt.22462openalex-snapshot
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs
inferred← citeshttps://doi.org/10.1002/jgt.70024openalex-snapshot
Cubic Graphs With Edges in Exactly One Perfect Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-19680-0_1openalex-snapshot
Genetic Theory for Cubic Graphs
inferred← citeshttps://doi.org/10.1007/s11227-020-03216-yopenalex-snapshot
Optimal low-latency network topologies for cluster performance enhancement
inferred← citeshttps://doi.org/10.1007/s11227-022-04421-7openalex-snapshot
Formal method for the synthesis of optimal topologies of computing systems based on the projective description of graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2025.129645openalex-snapshot
On (k,g)-graphs without (g + 1)-cycles
inferred← citeshttps://doi.org/10.1016/j.dam.2012.07.018openalex-snapshot
House of Graphs: A database of interesting graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.04.021openalex-snapshot
A counterexample to the pseudo 2-factor isomorphic graph conjecture
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.017openalex-snapshot
Integer sequence discovery from small graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.01.008openalex-snapshot
Fault-tolerant detectors for distinguishing sets in cubic graphs
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.2022.112963openalex-snapshot
Switching 3-edge-colorings of cubic graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113981openalex-snapshot
Generation and new infinite families of K2-hypohamiltonian graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.10.009openalex-snapshot
Enumeration of Seidel matrices
inferred← citeshttps://doi.org/10.1016/j.jtbi.2016.05.030openalex-snapshot
Transforming phylogenetic networks: Moving beyond tree space
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.018openalex-snapshot
Generation of various classes of trivalent graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.014openalex-snapshot
Extremal cubic graphs for fault-tolerant locating domination
inferred← citeshttps://doi.org/10.1017/s0004972709000896openalex-snapshot
TOPOLOGY OF INTERCONNECTION NETWORKS WITH GIVEN DEGREE AND DIAMETER
inferred← citeshttps://doi.org/10.1038/s41598-025-27661-yopenalex-snapshot
A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures
inferred← citeshttps://doi.org/10.1080/10586458.2025.2491675openalex-snapshot
Exhaustive Generation of Edge-Girth-Regular Graphs
inferred← citeshttps://doi.org/10.1109/icamcs.net46018.2018.00035openalex-snapshot
A Graph Similarity Relation Defined by Graph Transformation
inferred← citeshttps://doi.org/10.1145/3233547.3233679openalex-snapshot
An Algorithmic Approach to the Representation of Biological Information and Long-term Memory
inferred← citeshttps://doi.org/10.1155/2022/1618498openalex-snapshot
Graph Theory Algorithms of Hamiltonian Cycle from Quasi‐Spanning Tree and Domination Based on Vizing Conjecture
inferred← citeshttps://doi.org/10.11606/t.55.2016.tde-11012016-112023openalex-snapshot
A topologia de folheações e sistemas integráveis Morse-Bott em superfícies
inferred← citeshttps://doi.org/10.14232/ejqtde.2018.1.52openalex-snapshot
Moving average network examples for asymptotically stable periodic orbits of monotone maps
inferred← citeshttps://doi.org/10.23638/dmtcs-21-4-5openalex-snapshot
On almost hypohamiltonian graphs
inferred← citeshttps://doi.org/10.2478/s11533-014-0411-4openalex-snapshot
Secure sets and their expansion in cubic graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.1044.eaaopenalex-snapshot
Improved bounds for hypohamiltonian graphs
inferred← citeshttps://doi.org/10.3390/a14010009openalex-snapshot
Constructing Minimally 3-Connected Graphs
inferred← citeshttps://doi.org/10.37236/7327openalex-snapshot
On the Smallest Snarks with Oddness 4 and Connectivity 2
inferred← citeshttps://doi.org/10.46298/dmtcs.2111openalex-snapshot
Snarks with total chromatic number 5
inferred← citeshttps://doi.org/10.48550/arxiv.1605.05102openalex-snapshot
Enumeration of Enumeration Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1703.02943openalex-snapshot
Enumeration of Seidel matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1705.06928openalex-snapshot
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2009.01286openalex-snapshot
Charting the space of chemical nut graphs
inferred← citeshttps://doi.org/10.70675/c0b93ddcz747cz4e2fzb2a1zdccd7008991dopenalex-snapshot
Drawing graphs on surfaces of null and higher genus
inferred← citeshttps://doi.org/10.7151/dmgt.2283openalex-snapshot
Existence of regular nut graphs for degree at most 11
inferred← citeshttps://doi.org/10.7151/dmgt.2436openalex-snapshot
On singular signed graphs with nullspace spanned by a full vector: signed nut graphs
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.