On the public citation graph

Biased graphs whose matroids are special binary matroids

https://doi.org/10.1007/bf01787483
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.
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/jgt.3190050409openalex-snapshot
Characterizations of signed graphs
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_5openalex-snapshot
On the Abstract Properties of Linear Dependence1
inferredcites →https://doi.org/10.1007/978-1-4612-2972-8_8openalex-snapshot
2-Isomorphic Graphs
inferredcites →https://doi.org/10.1007/bf01111390openalex-snapshot
On subgraphs as matroid cells
inferredcites →https://doi.org/10.1016/0095-8956(77)90047-8openalex-snapshot
Kuratowski's and Wagner's theorems for matroids
inferredcites →https://doi.org/10.1016/0095-8956(80)90075-1openalex-snapshot
Decomposition of regular matroids
inferredcites →https://doi.org/10.1016/0095-8956(87)90051-7openalex-snapshot
The biased graphs whose matroids are binary
inferredcites →https://doi.org/10.1016/0095-8956(89)90063-4openalex-snapshot
Biased graphs. I. Bias, balance, and gains
inferredcites →https://doi.org/10.1016/0095-8956(91)90005-5openalex-snapshot
Biased graphs. II. The three matroids
inferredcites →https://doi.org/10.1016/0166-218x(82)90033-6openalex-snapshot
Signed graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1987-0897095-1openalex-snapshot
Vertices of Localized Imbalance in a Biased Graph
inferredcites →https://doi.org/10.2307/2371127openalex-snapshot
2-Isomorphic Graphs
inferredcites →https://doi.org/10.2307/2371182openalex-snapshot
On the Abstract Properties of Linear Dependence
inferredcites →https://doi.org/10.6028/jres.069b.001openalex-snapshot
Lectures on matroids

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.20108openalex-snapshot
A bidirected generalization of network matrices
inferred← citeshttps://doi.org/10.1007/978-3-642-32147-4_41openalex-snapshot
Recognition Algorithms for Binary Signed-Graphic Matroids
inferred← citeshttps://doi.org/10.1007/s00026-018-0396-yopenalex-snapshot
On Perturbations of Highly Connected Dyadic Matroids
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90005-5openalex-snapshot
Biased graphs. II. The three matroids
inferred← citeshttps://doi.org/10.1016/j.disc.2005.07.003openalex-snapshot
On cographic matroids and signed-graphic matroids
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.052openalex-snapshot
Connectivity in frame matroids
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.11.001openalex-snapshot
On excluded minors of connectivity 2 for the class of frame matroids
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.10.002openalex-snapshot
Projective-planar signed graphs and tangled signed graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.02.007openalex-snapshot
Matrix representations of frame and lifted-graphic matroids correspond to gain functions
inferred← citeshttps://doi.org/10.1016/s0095-8956(03)00035-2openalex-snapshot
Biased graphs IV: Geometrical realizations
inferred← citeshttps://doi.org/10.1017/s0963548309990241openalex-snapshot
The Regular Excluded Minors for Signed-Graphic Matroids
inferred← citeshttps://doi.org/10.1090/s0002-9947-1989-0957084-1openalex-snapshot
A Generalisation of the Matroid Lift Construction
inferred← citeshttps://doi.org/10.1137/100801007openalex-snapshot
Decomposition of Binary Signed-Graphic Matroids
inferred← citeshttps://doi.org/10.1137/20m1369403openalex-snapshot
On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.4610openalex-snapshot
Templates for Representable Matroids
inferred← citeshttps://doi.org/10.37236/29openalex-snapshot
A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas
inferred← citeshttps://doi.org/10.48550/arxiv.1011.6497openalex-snapshot
Decomposition of Binary Signed-Graphic Matroids
inferred← citeshttps://doi.org/10.48550/arxiv.1011.6504openalex-snapshot
Recognition algorithms for binary signed-graphic matroids
inferred← citeshttps://doi.org/10.48550/arxiv.1403.7667openalex-snapshot
When does a biased graph come from a group labelling?
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.