On the public citation graph
Graphs with prescribed degree sets and girth
0 signed · 33 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.
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.3190070210openalex-snapshot
Regular graphs with given girth pair
inferred← citeshttps://doi.org/10.1002/net.20349openalex-snapshot
On the connectivity of semiregular cages
inferred← citeshttps://doi.org/10.1002/net.20431openalex-snapshot
Edge‐superconnectivity of semiregular cages with odd girth
inferred← citeshttps://doi.org/10.1007/978-3-031-93669-2_9openalex-snapshot
Contributions on the Cage and Diameter Problems and Beyond
inferred← citeshttps://doi.org/10.1007/s00010-013-0227-5openalex-snapshot
On bi-regular cages of even girth at least 8
inferred← citeshttps://doi.org/10.1007/s102550200048openalex-snapshot
On the Monotonicity of (k;g,h)-graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90113-xopenalex-snapshot
The minimal trivalent graphs with given smallest odd cycle
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90596-8openalex-snapshot
On cages with given degree sets
inferred← citeshttps://doi.org/10.1016/j.aml.2011.05.024openalex-snapshot
Monotonicity of the order of (D;g) -cages
inferred← citeshttps://doi.org/10.1016/j.disc.2006.03.033openalex-snapshot
The face pair of planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.05.019openalex-snapshot
On the order of ({r,m};g) -cages of even girth
inferred← citeshttps://doi.org/10.1016/j.disc.2008.02.012openalex-snapshot
Constructions of bi-regular cages
inferred← citeshttps://doi.org/10.1016/j.disc.2015.10.009openalex-snapshot
Small bi-regular graphs of even girth
inferred← citeshttps://doi.org/10.1016/j.endm.2006.08.001openalex-snapshot
On the order of bi-regular cages of even girth
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.003openalex-snapshot
Constructions of biregular cages of girth five
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.012openalex-snapshot
Bounds on the order of biregular graphs with even girth at least 8
inferred← citeshttps://doi.org/10.1016/j.procs.2023.08.262openalex-snapshot
Voltage graphs as a technique to obtaining semi-cubic cages (Brief Announcement)
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00758-6openalex-snapshot
The minimum number of vertices with girth 6 and degree set D={r,m}
inferred← citeshttps://doi.org/10.1080/00207160.2010.504828openalex-snapshot
Diameter and connectivity of (D; g)-cages
inferred← citeshttps://doi.org/10.1109/isit.2018.8437465openalex-snapshot
From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2018.2879823openalex-snapshot
From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes
inferred← citeshttps://doi.org/10.1515/ausi-2015-0013openalex-snapshot
Tripartite graphs with given degree set
inferred← citeshttps://doi.org/10.2478/ausi-2020-0015openalex-snapshot
On degree sets in k-partite graphs
inferred← citeshttps://doi.org/10.26493/2590-9770.1743.19fopenalex-snapshot
A note on girth-diameter cages
inferred← citeshttps://doi.org/10.46298/dmtcs.499openalex-snapshot
Some properties of semiregular cages
inferred← citeshttps://doi.org/10.48550/arxiv.1811.07449openalex-snapshot
Regular and biregular planar cages
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.