On the public citation graph
Problems in Algebraic Combinatorics
0 signed · 75 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/jgt.3190030314openalex-snapshot
Long cycles in vertex‐transitive graphs
inferredcites →https://doi.org/10.1002/jgt.3190160504openalex-snapshot
An approach to hedetniemi's conjecture
inferredcites →https://doi.org/10.1007/bf00147743openalex-snapshot
Strongly regular graphs and spin models for the Kauffman polynomial
inferredcites →https://doi.org/10.1007/bf01113923openalex-snapshot
On incidence matrices of finite projective and affine spaces
inferredcites →https://doi.org/10.1007/bf02240204openalex-snapshot
Graph isomorphism and theorems of Birkhoff type
inferredcites →https://doi.org/10.1007/bf02579177openalex-snapshot
Independence numbers of graphs and generators of ideals
inferredcites →https://doi.org/10.1007/bf02579374openalex-snapshot
The chromatic number of the product of two 4-chromatic graphs is 4
inferredcites →https://doi.org/10.1007/bf02773749openalex-snapshot
Rank of inclusion matrices and modular representation theory
inferredcites →https://doi.org/10.1016/0012-365x(82)90045-0openalex-snapshot
On the non-existence of perfect and nearly perfect codes
inferredcites →https://doi.org/10.1016/0012-365x(83)90079-1openalex-snapshot
A note on the existence of perfect constant weight codes
inferredcites →https://doi.org/10.1016/0012-365x(84)90010-4openalex-snapshot
A survey: Hamiltonian cycles in Cayley graphs
inferredcites →https://doi.org/10.1016/0012-365x(92)00057-xopenalex-snapshot
Stable sets and polynomials
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/0024-3795(77)90027-1openalex-snapshot
On graphs whose least eigenvalue exceeds − 1 − √2
inferredcites →https://doi.org/10.1016/0024-3795(82)90022-2openalex-snapshot
The second largest eigenvalue of a tree
inferredcites →https://doi.org/10.1016/0024-3795(88)90054-7openalex-snapshot
A note on certain subpolytopes of the assignment polytope associated with circulant graphs
inferredcites →https://doi.org/10.1016/0095-8956(86)90068-7openalex-snapshot
Cayley digraphs of prime-power order are hamiltonian
inferredcites →https://doi.org/10.1016/0097-3165(78)90022-5openalex-snapshot
Kneser's conjecture, chromatic number, and homotopy
inferredcites →https://doi.org/10.1016/0166-218x(91)90049-3openalex-snapshot
A note on compact graphs
inferredcites →https://doi.org/10.1016/0166-218x(92)90230-8openalex-snapshot
A domain monotonicity theorem for graphs and Hamiltonicity
inferredcites →https://doi.org/10.1016/s0095-8956(81)80024-xopenalex-snapshot
On the arc-chromatic number of a digraph
inferredcites →https://doi.org/10.1016/s0195-6698(13)80046-7openalex-snapshot
A Diagonal Form for the Incidence Matrices of t-Subsets vs.k-Subsets
inferredcites →https://doi.org/10.1017/cbo9780511623714openalex-snapshot
Designs, Graphs, Codes and their Links
inferredcites →https://doi.org/10.1017/s0017089500004146openalex-snapshot
Perfect codes in the graphs Ok and L(Ok)
inferredcites →https://doi.org/10.1090/s0002-9939-1966-0204305-9openalex-snapshot
A Certain Class of Incidence Matrices
inferredcites →https://doi.org/10.1109/tit.1979.1055985openalex-snapshot
On the Shannon capacity of a graph
inferredcites →https://doi.org/10.1137/0518015openalex-snapshot
On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
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.23018openalex-snapshot
Some conditions implying stability of graphs
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_4openalex-snapshot
Graph homomorphisms: structure and symmetry
inferred← citeshttps://doi.org/10.1007/s00373-015-1613-7openalex-snapshot
Linear Programming Bounds for Regular Graphs
inferred← citeshttps://doi.org/10.1007/s10801-017-0791-1openalex-snapshot
Resilience of ranks of higher inclusion matrices
inferred← citeshttps://doi.org/10.1007/s40096-019-00307-7openalex-snapshot
On matching integral graphs
inferred← citeshttps://doi.org/10.1016/b978-0-12-374890-4.00012-4openalex-snapshot
Boolean Cayley graphs
inferred← citeshttps://doi.org/10.1016/b978-0-12-811129-1.00009-2openalex-snapshot
Boolean Cayley Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.10.018openalex-snapshot
Lower bounds on matching energy of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.04.001openalex-snapshot
Graph homomorphisms via vector colorings
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.06.003openalex-snapshot
Recent progress in algebraic design theory
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.10.012openalex-snapshot
Graphs with six distinct matching roots
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.11.006openalex-snapshot
New lower bound on the Shannon capacity of C7 from circular graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2009.05.001openalex-snapshot
An analogue of the Gallai–Edmonds Structure Theorem for non-zero roots of the matching polynomial
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.02.001openalex-snapshot
An extremal problem motivated by triangle-free strongly regular graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2005.06.027openalex-snapshot
Trace-minimal graphs and D-optimal weighing designs
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00229-0openalex-snapshot
Improved lower bound on the Shannon capacity of C7
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00597-8openalex-snapshot
Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers
inferred← citeshttps://doi.org/10.1016/s0898-1221(98)00169-2openalex-snapshot
The independence number of the strong product of cycles
inferred← citeshttps://doi.org/10.1017/cbo9781107325425.005openalex-snapshot
Strongly regular graphs with no triangles
inferred← citeshttps://doi.org/10.1080/03081087.2016.1267105openalex-snapshot
Perfect state transfer on gcd-graphs
inferred← citeshttps://doi.org/10.1090/s0002-9947-06-03859-1openalex-snapshot
The invariant factors of the incidence matrices of points and subspaces in PG(h,k) and AG(h,k)
inferred← citeshttps://doi.org/10.11591/telkomnika.v11i3.2304openalex-snapshot
A Framework of Fingerprint Scaling
inferred← citeshttps://doi.org/10.1515/advgeom-2015-0019openalex-snapshot
Danzer’s configuration revisited
inferred← citeshttps://doi.org/10.23638/lmcs-15(1:25)2019openalex-snapshot
On the First-Order Complexity of Induced Subgraph Isomorphism
inferred← citeshttps://doi.org/10.31274/etd-180810-2245openalex-snapshot
Coloring and extremal problems in combinatorics
inferred← citeshttps://doi.org/10.37236/170openalex-snapshot
Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover
inferred← citeshttps://doi.org/10.37236/3954openalex-snapshot
Conditions for the Parameters of the Block Graph of Quasi-Symmetric Designs
inferred← citeshttps://doi.org/10.37236/525openalex-snapshot
Maximum Multiplicity of Matching Polynomial Roots and Minimum Path Cover in General Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0911.2455openalex-snapshot
Families of parameters for SRNT graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1003.0175openalex-snapshot
The Second Subconstituent of some Strongly Regular Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1103.2572openalex-snapshot
Strongly regular n-e.c. graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1909.08722openalex-snapshot
A characterization of 2-neighborhood degree list of diameter 2 graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2005.02945openalex-snapshot
New Methods in Coding Theory: Error-Correcting Codes and the Shannon Capacity
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.