On the public citation graph
Dynamic Cage Survey
0 signed · 219 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(199702)24:2<187::aid-jgt6>3.0.co;2-mopenalex-snapshot
Connectivity of cages
inferredcites →https://doi.org/10.1002/jgt.3190050105openalex-snapshot
The smallest graph of girth 6 and valency 7
inferredcites →https://doi.org/10.1002/net.20392openalex-snapshot
Constructions of small regular bipartite graphs of girth 6
inferredcites →https://doi.org/10.1006/eujc.2000.0441openalex-snapshot
Regular Maps on Surfaces with Large Planar Width
inferredcites →https://doi.org/10.1006/jctb.1995.1033openalex-snapshot
Graphs of Prescribed Girth and Bi-Degree
inferredcites →https://doi.org/10.1007/978-94-015-8937-6_7openalex-snapshot
Finite transitive permutation groups and finite vertex-transitive graphs
inferredcites →https://doi.org/10.1007/978-94-017-1108-1_21openalex-snapshot
Large Cayley Graphs and Digraphs with Small Degree and Diameter
inferredcites →https://doi.org/10.1007/bf02579157openalex-snapshot
Explicit construction of regular graphs without small cycles
inferredcites →https://doi.org/10.1007/bf02579283openalex-snapshot
Explicit constructions of graphs without short cycles and low density codes
inferredcites →https://doi.org/10.1007/bf02579289openalex-snapshot
The sextet construction for cubic graphs
inferredcites →https://doi.org/10.1007/bf02684706openalex-snapshot
Sur la trialité et certains groupes qui s'en déduisent
inferredcites →https://doi.org/10.1016/0012-365x(80)90238-1openalex-snapshot
A trivalent graph with 58 vertices and girth 9
inferredcites →https://doi.org/10.1016/0012-365x(83)90029-8openalex-snapshot
On the smallest graphs of girth 10 and valency 3
inferredcites →https://doi.org/10.1016/0016-0032(60)90676-1openalex-snapshot
An introduction to the theory of numbers
inferredcites →https://doi.org/10.1016/0021-8693(64)90028-6openalex-snapshot
The nonexistence of certain generalized polygons
inferredcites →https://doi.org/10.1016/0021-8693(71)90087-1openalex-snapshot
The nonexistence of rank three permutation groups of degree 3250 and subdegree 57
inferredcites →https://doi.org/10.1016/0095-8956(71)90015-3openalex-snapshot
On a graph of Hoffman and Singleton
inferredcites →https://doi.org/10.1016/0095-8956(72)90028-7openalex-snapshot
A trivalent graph of girth ten
inferredcites →https://doi.org/10.1016/0095-8956(73)90003-8openalex-snapshot
A smallest graph of girth 5 and valency 5
inferredcites →https://doi.org/10.1016/0095-8956(79)90052-2openalex-snapshot
A smallest graph of girth 5 and valency 6
inferredcites →https://doi.org/10.1016/0095-8956(90)90026-vopenalex-snapshot
Note on the girth of Ramanujan graphs
inferredcites →https://doi.org/10.1016/j.disc.2004.08.029openalex-snapshot
Girth 5 graphs from relative difference sets
inferredcites →https://doi.org/10.1016/j.disc.2005.09.039openalex-snapshot
On the number of closed walks in vertex-transitive graphs
inferredcites →https://doi.org/10.1016/j.disc.2009.12.014openalex-snapshot
Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages
inferredcites →https://doi.org/10.1016/j.disc.2009.12.025openalex-snapshot
On upper bounds of odd girth cages
inferredcites →https://doi.org/10.1016/j.ejc.2010.02.002openalex-snapshot
On the limitations of the use of solvable groups in Cayley graph cage constructions
inferredcites →https://doi.org/10.1016/j.ejc.2010.12.003openalex-snapshot
On the girth of voltage graph lifts
inferredcites →https://doi.org/10.1016/j.jda.2010.11.001openalex-snapshot
Computational determination of (3,11) and (4,7) cages
inferredcites →https://doi.org/10.1016/s0012-365x(99)00222-8openalex-snapshot
Cayley type graphs and cubic graphs of large girth
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1017/s0963548300001693openalex-snapshot
The Smallest Cubic Graphs of Girth Nine
inferredcites →https://doi.org/10.1023/a:1026476701774openalex-snapshot
Algorithms for Greechie Diagrams
inferredcites →https://doi.org/10.1073/pnas.60.2.438openalex-snapshot
SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
inferredcites →https://doi.org/10.1090/s0002-9904-1964-11250-7openalex-snapshot
The smallest graph of girth 5 and valency 4
inferredcites →https://doi.org/10.1090/s0025-5718-99-01037-6openalex-snapshot
The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
inferredcites →https://doi.org/10.1090/s0273-0979-1995-00569-0openalex-snapshot
A new series of dense graphs of high girth
inferredcites →https://doi.org/10.1093/oso/9780198502951.001.0001openalex-snapshot
Projective Geometries over Finite Fields
inferredcites →https://doi.org/10.1109/ispan.2005.23openalex-snapshot
Cages: constructions and new upper bounds
inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb22437.xopenalex-snapshot
Cubic Graphs with Large Girth
inferredcites →https://doi.org/10.1112/jlms/s1-38.1.423openalex-snapshot
Regular Graphs with Given Girth and Restricted Circuits
inferredcites →https://doi.org/10.1112/jlms/s1-42.1.514openalex-snapshot
On Hamiltonian Regular Graphs of Girth Six
inferredcites →https://doi.org/10.1137/s0895480101387893openalex-snapshot
A High Girth Graph Construction
inferredcites →https://doi.org/10.1147/rd.45.0497openalex-snapshot
On Moore Graphs with Diameters 2 and 3
inferredcites →https://doi.org/10.1155/s0161171284000806openalex-snapshot
On certain regular graphs of girth 5
inferredcites →https://doi.org/10.1155/s0161171286000704openalex-snapshot
A regular graph of girth 6 and valency 11
inferredcites →https://doi.org/10.11575/cdm.v3i1.61998openalex-snapshot
On geometric constructions of (k, g)-graphs
inferredcites →https://doi.org/10.18311/jims/1942/17165openalex-snapshot
An Affine Analogue of Singer's Theorem
inferredcites →https://doi.org/10.2307/3062153openalex-snapshot
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders
inferredcites →https://doi.org/10.26493/1855-3974.50.b13openalex-snapshot
Injectivity radius of representations of triangle groups and planar width of regular hypermaps
inferredcites →https://doi.org/10.37236/1386openalex-snapshot
Constructions for Cubic Graphs with Large Girth
inferredcites →https://doi.org/10.37236/1830openalex-snapshot
On the Graphs of Hoffman-Singleton and Higman-Sims
inferredcites →https://doi.org/10.37236/1843openalex-snapshot
Voltage Graphs, Group Presentations and Cages
inferredcites →https://doi.org/10.37236/35openalex-snapshot
Moore Graphs and Beyond: A survey of the Degree/Diameter Problem
inferredcites →https://doi.org/10.4153/cjm-1949-009-2openalex-snapshot
The Nonexistence of Certain Finite Projective Planes
inferredcites →https://doi.org/10.4153/cjm-1967-058-3openalex-snapshot
On the Non-Existence of a Type of Regular Graphs of Girth 5
inferredcites →https://doi.org/10.4153/cjm-1989-049-4openalex-snapshot
The Non-Existence of Finite Projective Planes of Order 10
inferredcites →https://doi.org/10.4153/cmb-1960-018-1openalex-snapshot
A Minimal Cubic Graph of Girth Seven
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.22764openalex-snapshot
Perfect matchings in highly cyclically connected regular graphs
inferred← citeshttps://doi.org/10.1002/jgt.22964openalex-snapshot
Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width
inferred← citeshttps://doi.org/10.1002/jgt.23082openalex-snapshot
The structure of digraphs with excess one
inferred← citeshttps://doi.org/10.1002/net.20377openalex-snapshot
Ranking measures for radially Moore graphs
inferred← citeshttps://doi.org/10.1002/net.20392openalex-snapshot
Constructions of small regular bipartite graphs of girth 6
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_124openalex-snapshot
New Bounds on k-Geodetic Digraphs and Mixed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-93954-0_56-1openalex-snapshot
The Computational Challenge of Constructing Cages and (k, g)-Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-31940-7_3openalex-snapshot
Conjectures on Cops and Robbers
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/s00373-011-1091-5openalex-snapshot
On Superconnectivity of (4, g)-Cages
inferred← citeshttps://doi.org/10.1007/s00373-019-02021-6openalex-snapshot
Largest 2-Regular Subgraphs in 3-Regular Graphs
inferred← citeshttps://doi.org/10.1007/s00373-019-02114-2openalex-snapshot
On Total Regularity of Mixed Graphs with Order Close to the Moore Bound
inferred← citeshttps://doi.org/10.1007/s00373-021-02368-9openalex-snapshot
Extremal Edge-Girth-Regular Graphs
inferred← citeshttps://doi.org/10.1007/s00373-022-02500-3openalex-snapshot
On New Record Graphs Close to Bipartite Moore Graphs
inferred← citeshttps://doi.org/10.1007/s00373-022-02535-6openalex-snapshot
On Networks with Order Close to the Moore Bound
inferred← citeshttps://doi.org/10.1007/s10440-021-00429-yopenalex-snapshot
A Connection Between a Question of Bermond and Bollobás and Ramanujan Graphs
inferred← citeshttps://doi.org/10.1007/s10623-010-9364-1openalex-snapshot
Adjacency matrices of polarity graphs and of other C 4-free graphs of large size
inferred← citeshttps://doi.org/10.1007/s10910-025-01747-4openalex-snapshot
Spectral polynomials, graph descriptors, spectra, and entropies of cage graphs
inferred← citeshttps://doi.org/10.1007/s11432-018-9482-6openalex-snapshot
Erasure coding for distributed storage: an overview
inferred← citeshttps://doi.org/10.1016/j.amc.2018.09.053openalex-snapshot
Vertex-connectivity and eigenvalues of graphs with fixed girth
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.aml.2012.01.036openalex-snapshot
A new bound for the connectivity of cages
inferred← citeshttps://doi.org/10.1016/j.camwa.2011.07.033openalex-snapshot
New graphs related to (p,6) and (p,8) -cages
inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.008openalex-snapshot
A note on the upper bound and girth pair of (k;g) -cages
inferred← citeshttps://doi.org/10.1016/j.dam.2015.01.003openalex-snapshot
Wheel and star-critical Ramsey numbers for quadrilateral
inferred← citeshttps://doi.org/10.1016/j.dam.2015.03.020openalex-snapshot
On a conjecture on the order of cages with a given girth pair
inferred← citeshttps://doi.org/10.1016/j.dam.2016.10.004openalex-snapshot
The complexity of partitioning into disjoint cliques and a triangle-free graph
inferred← citeshttps://doi.org/10.1016/j.dam.2017.04.014openalex-snapshot
Codes for distributed storage from 3-regular graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.034openalex-snapshot
On diregular digraphs with degree two and excess two
inferred← citeshttps://doi.org/10.1016/j.dam.2018.04.020openalex-snapshot
Rainbow connectivity of Moore cages of girth 6
inferred← citeshttps://doi.org/10.1016/j.dam.2019.02.045openalex-snapshot
On diregular digraphs with degree two and excess three
inferred← citeshttps://doi.org/10.1016/j.dam.2020.10.009openalex-snapshot
On the packing chromatic number of Moore graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.006openalex-snapshot
Distances in graphs of girth 6 and generalised cages
inferred← citeshttps://doi.org/10.1016/j.dam.2026.01.017openalex-snapshot
Cops and robbers on multi-layer graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.12.014openalex-snapshot
Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages
inferred← citeshttps://doi.org/10.1016/j.disc.2009.12.025openalex-snapshot
On upper bounds of odd girth cages
inferred← citeshttps://doi.org/10.1016/j.disc.2011.10.021openalex-snapshot
Recursive constructions of small regular graphs of given degree and girth
inferred← citeshttps://doi.org/10.1016/j.disc.2012.05.020openalex-snapshot
Families of small regular graphs of girth 5
inferred← citeshttps://doi.org/10.1016/j.disc.2013.12.015openalex-snapshot
On the order of graphs with a given girth pair
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.disc.2017.03.020openalex-snapshot
New small regular graphs of girth 5
inferred← citeshttps://doi.org/10.1016/j.disc.2017.11.015openalex-snapshot
On the excess of vertex-transitive graphs of given degree and girth
inferred← citeshttps://doi.org/10.1016/j.disc.2019.02.007openalex-snapshot
Improving bounds on the order of regular graphs of girth 5
inferred← citeshttps://doi.org/10.1016/j.disc.2019.04.004openalex-snapshot
On biregular bipartite graphs of small excess
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112197openalex-snapshot
The cubic graphs with finite cyclic vertex connectivity larger than girth
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112320openalex-snapshot
New values for the bipartite Ramsey number of the four-cycle versus stars
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112531openalex-snapshot
Regular Turán numbers of complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112582openalex-snapshot
Bipartite biregular Moore graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.02.002openalex-snapshot
On the limitations of the use of solvable groups in Cayley graph cage constructions
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.10.014openalex-snapshot
Partial linear spaces and identifying codes
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.12.003openalex-snapshot
On the girth of voltage graph lifts
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.07.005openalex-snapshot
On regular graphs of girth six arising from projective planes
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.09.002openalex-snapshot
Cycles with consecutive odd lengths
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.016openalex-snapshot
New results on connectivity of cages
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.endm.2013.05.060openalex-snapshot
Families of small regular graphs of girth 7
inferred← citeshttps://doi.org/10.1016/j.endm.2016.09.025openalex-snapshot
New family of small regular graphs of girth 5
inferred← citeshttps://doi.org/10.1016/j.endm.2018.06.042openalex-snapshot
Elliptic semiplanes and regular graphs with girth 5
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.09.001openalex-snapshot
Proof of a conjecture on monomial graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2018.03.015openalex-snapshot
On regular induced subgraphs of generalized polygons
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.07.002openalex-snapshot
On the defect of vertex-transitive graphs of given degree and diameter
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.01.002openalex-snapshot
Symmetry properties of generalized graph truncations
inferred← citeshttps://doi.org/10.1016/j.jda.2010.11.001openalex-snapshot
Computational determination of (3,11) and (4,7) cages
inferred← citeshttps://doi.org/10.1016/j.jda.2014.02.001openalex-snapshot
A new upper bound for the traveling salesman problem in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.jsc.2012.09.002openalex-snapshot
Cubic vertex-transitive graphs on up to 1280 vertices
inferred← citeshttps://doi.org/10.1016/j.laa.2014.12.023openalex-snapshot
Maximizing algebraic connectivity for certain families of graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2018.02.010openalex-snapshot
On the non-existence of antipodal cages of even girth
inferred← citeshttps://doi.org/10.1016/j.laa.2019.05.022openalex-snapshot
Spanning tree packing number and eigenvalues of graphs with given girth
inferred← citeshttps://doi.org/10.1016/j.laa.2020.08.015openalex-snapshot
Connectivity and eigenvalues of graphs with given girth or clique number
inferred← citeshttps://doi.org/10.1016/j.laa.2020.10.023openalex-snapshot
Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.298openalex-snapshot
Constructions of Small Regular Mixed Graphs with Girth 5 and 6
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.335openalex-snapshot
New lower bounds for the order of cages
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.034openalex-snapshot
Online graph exploration: New results on old and new algorithms
inferred← citeshttps://doi.org/10.1017/s0963548311000101openalex-snapshot
Lower Bounds for the Cop Number when the Robber is Fast
inferred← citeshttps://doi.org/10.1080/00207160.2010.504828openalex-snapshot
Diameter and connectivity of (D; g)-cages
inferred← citeshttps://doi.org/10.1080/00207160.2016.1210792openalex-snapshot
A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
inferred← citeshttps://doi.org/10.1103/physreva.104.052419openalex-snapshot
Fixed-angle conjectures for the quantum approximate optimization algorithm on regular MaxCut graphs
inferred← citeshttps://doi.org/10.1109/c3it.2015.7060128openalex-snapshot
Design of structured irregular LDPC codes from structured regular LDPC codes
inferred← citeshttps://doi.org/10.1109/ciss.2011.5766234openalex-snapshot
Fundamental bounds on the interconnect complexity of decoder implementations
inferred← citeshttps://doi.org/10.1109/i-span.2012.26openalex-snapshot
Topology Construction of Near-Optimal Covert Communications Networks
inferred← citeshttps://doi.org/10.1109/isit.2011.6034230openalex-snapshot
Some voltage graph-based LDPC tailbiting codes with large girth
inferred← citeshttps://doi.org/10.1109/isit.2017.8006835openalex-snapshot
A tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures
inferred← citeshttps://doi.org/10.1109/isit.2018.8437460openalex-snapshot
Load-Balanced Fractional Repetition Codes
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/lcomm.2014.2349982openalex-snapshot
Large Girth Column-Weight Two and Three LDPC Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2014.2387341openalex-snapshot
Nonbinary LDPC Codes on Cages: Structural Property and Code Optimization
inferred← citeshttps://doi.org/10.1109/tit.2011.2176717openalex-snapshot
Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth
inferred← citeshttps://doi.org/10.1109/tit.2015.2496213openalex-snapshot
Searching for Binary and Nonbinary Block and Convolutional LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2531720openalex-snapshot
Fractional Repetition Codes With Flexible Repair From Combinatorial Designs
inferred← citeshttps://doi.org/10.1109/tit.2019.2958970openalex-snapshot
A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures
inferred← citeshttps://doi.org/10.1109/tpds.2016.2635640openalex-snapshot
Projective Networks: Topologies for Large Parallel Computer Systems
inferred← citeshttps://doi.org/10.1134/s0032946009040061openalex-snapshot
Graph-based convolutional and block LDPC codes
inferred← citeshttps://doi.org/10.11575/cdm.v9i1.62207openalex-snapshot
On the minimum order of $k$-cop win graphs
inferred← citeshttps://doi.org/10.15826/umj.2025.2.008openalex-snapshot
A FAMILY OF ARC-TRANSITIVE GRAPHS OF GIRTH AT LEAST 5 ADMITTING A SUZUKI SIMPLE GROUP
inferred← citeshttps://doi.org/10.1587/transfun.e102.a.1420openalex-snapshot
Further Results on the Separating Redundancy of Binary Linear Codes
inferred← citeshttps://doi.org/10.20429/tag.2022.100102openalex-snapshot
On Rainbow Cycles and Proper Edge Colorings of Generalized Polygons
inferred← citeshttps://doi.org/10.23638/dmtcs-21-3-9openalex-snapshot
Bounds for the smallest $k$-chromatic graphs of given girth
inferred← citeshttps://doi.org/10.26493/1855-3974.124.06dopenalex-snapshot
Small vertex-transitive graphs of given degree and girth
inferred← citeshttps://doi.org/10.26493/1855-3974.2935.a7bopenalex-snapshot
On girth-biregular graphs
inferred← citeshttps://doi.org/10.26493/2590-9770.1425.1deopenalex-snapshot
On the automorphisms of a family of small q-regular graphs of girth 8
inferred← citeshttps://doi.org/10.26493/2590-9770.1732.6acopenalex-snapshot
Geometric constructions of small regular graphs with girth 7
inferred← citeshttps://doi.org/10.26493/2590-9770.1733.dc9openalex-snapshot
On extremal (almost) edge-girth-regular graphs
inferred← citeshttps://doi.org/10.26493/2590-9770.1737.0f8openalex-snapshot
On (r,g,χ)- graphs and cages of regularity r, girth g and chromatic number χ
inferred← citeshttps://doi.org/10.26493/2590-9770.1739.91copenalex-snapshot
Banff designs: difference methods for coloring incidence graphs
inferred← citeshttps://doi.org/10.26493/2590-9770.1743.19fopenalex-snapshot
A note on girth-diameter cages
inferred← citeshttps://doi.org/10.3390/e26121014openalex-snapshot
It Is Better to Be Semi-Regular When You Have a Low Degree
inferred← citeshttps://doi.org/10.3390/sym12010002openalex-snapshot
A Structured Table of Graphs with Symmetries and Other Special Properties
inferred← citeshttps://doi.org/10.37236/35openalex-snapshot
Moore Graphs and Beyond: A survey of the Degree/Diameter Problem
inferred← citeshttps://doi.org/10.37236/4397openalex-snapshot
A Construction of Small $(q-1)$-Regular Graphs of Girth 8
inferred← citeshttps://doi.org/10.37236/4854openalex-snapshot
Applications of Integer Programming Methods to Cages
inferred← citeshttps://doi.org/10.3934/amc.2021003openalex-snapshot
Extremal absorbing sets in low-density parity-check codes
inferred← citeshttps://doi.org/10.4171/pm/1983openalex-snapshot
The locus of Brill–Noether general graphs is not dense
inferred← citeshttps://doi.org/10.46298/dmtcs.499openalex-snapshot
Some properties of semiregular cages
inferred← citeshttps://doi.org/10.48550/arxiv.1009.3608openalex-snapshot
Computational determination of (3,11) and (4,7) cages
inferred← citeshttps://doi.org/10.48550/arxiv.1106.1472openalex-snapshot
Separating Pants Decompositions in the Pants Complex
inferred← citeshttps://doi.org/10.48550/arxiv.1110.0768openalex-snapshot
The Petersen graph is the smallest 3-cop-win graph
inferred← citeshttps://doi.org/10.48550/arxiv.1111.3279openalex-snapshot
An explicit formula for obtaining $(q+1,8)$-cages and others small regular graphs of girth 8
inferred← citeshttps://doi.org/10.48550/arxiv.1211.2672openalex-snapshot
Families of small regular graphs of girth 7
inferred← citeshttps://doi.org/10.48550/arxiv.1409.4966openalex-snapshot
Transitivity is not a (big) restriction on homotopy types
inferred← citeshttps://doi.org/10.48550/arxiv.1501.02448openalex-snapshot
A formulation of a (q+1,8)-cage
inferred← citeshttps://doi.org/10.48550/arxiv.1501.02452openalex-snapshot
A construction of small (q-1)-regular graphs of girth 8
inferred← citeshttps://doi.org/10.48550/arxiv.1612.07103openalex-snapshot
On bipartite cages of excess 4
inferred← citeshttps://doi.org/10.48550/arxiv.1703.08109openalex-snapshot
Cayley graphs and symmetric interconnection networks
inferred← citeshttps://doi.org/10.48550/arxiv.1806.04437openalex-snapshot
Erasure Coding for Distributed Storage: An Overview
inferred← citeshttps://doi.org/10.48550/arxiv.1806.04474openalex-snapshot
Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions
inferred← citeshttps://doi.org/10.48550/arxiv.1808.06101openalex-snapshot
Spanning tree packing, edge-connectivity and eigenvalues of graphs with given girth
inferred← citeshttps://doi.org/10.48550/arxiv.1812.02502openalex-snapshot
A Tight Rate Bound and Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple Erasures
inferred← citeshttps://doi.org/10.48550/arxiv.1903.08795openalex-snapshot
Largest 2-regular subgraphs in 3-regular graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1904.05618openalex-snapshot
Fractional chromatic number, maximum degree and girth
inferred← citeshttps://doi.org/10.48550/arxiv.1907.11568openalex-snapshot
Bipartite Biregular Cages and Block Designs
inferred← citeshttps://doi.org/10.48550/arxiv.2009.13709openalex-snapshot
Mixed Cages: monotony, connectivity and upper bounds
inferred← citeshttps://doi.org/10.48550/arxiv.2108.06636openalex-snapshot
Edge-girth-regular graphs arising from biaffine planes and Suzuki groups
inferred← citeshttps://doi.org/10.5281/zenodo.6576525openalex-snapshot
Cubic vertex-transitive graphs on up to 1280 vertices.
inferred← citeshttps://doi.org/10.5614/ejgta.2014.2.2.9openalex-snapshot
Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey
inferred← citeshttps://doi.org/10.5840/hyle201319110openalex-snapshot
Chemical Graph Theory and the Sherlock Holmes Principle
inferred← citeshttps://doi.org/10.7151/dmgt.1657openalex-snapshot
Distance-locally disconnected graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2233openalex-snapshot
Spectra of orders for k-regular graphs of girth g
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.