On the public citation graph

On subgraphs as matroid cells

https://doi.org/10.1007/bf01111390
0 signed · 50 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.1007/978-0-8176-4842-8_5openalex-snapshot
On the Abstract Properties of Linear Dependence1
inferredcites →https://doi.org/10.1007/bfb0060114openalex-snapshot
Matroids versus graphs
inferredcites →https://doi.org/10.1137/0112059openalex-snapshot
A Solution of the Shannon Switching Game
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.2307/2371182openalex-snapshot
On the Abstract Properties of Linear Dependence

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.3190020208openalex-snapshot
Matroidal families of finite connected nonhomeomorphic graphs exist
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_101openalex-snapshot
On matroids and hierarchical graphs
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_228openalex-snapshot
A primal-dual approach to approximation of node-deletion problems for matroidal properties
inferred← citeshttps://doi.org/10.1007/978-3-319-28186-5_23openalex-snapshot
An Existence Problem for Matroidal Families
inferred← citeshttps://doi.org/10.1007/978-3-642-95322-4_20openalex-snapshot
Matroids on the Edge Sets of Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-94-010-1220-1_8openalex-snapshot
Transversal Matroids and Related Structures
inferred← citeshttps://doi.org/10.1007/bf01787483openalex-snapshot
Biased graphs whose matroids are special binary matroids
inferred← citeshttps://doi.org/10.1016/0012-365x(75)90095-3openalex-snapshot
On matroids on edge sets of graphs with connected subgraphs as circuits II
inferred← citeshttps://doi.org/10.1016/0012-365x(75)90096-5openalex-snapshot
Subgraphs as circuits and bases of matroids
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90119-4openalex-snapshot
Infinite graphs and bicircular matroids
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90172-3openalex-snapshot
Matroids from directed graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90072-4openalex-snapshot
On the existence of uncountably many matroidal families
inferred← citeshttps://doi.org/10.1016/0012-365x(82)90027-9openalex-snapshot
Construction of matroidal families by partly closed sets
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90107-9openalex-snapshot
A characterization of matroidal families of multigraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90265-hopenalex-snapshot
Characterizing bias matroids
inferred← citeshttps://doi.org/10.1016/0095-8956(79)90018-2openalex-snapshot
Infinite subgraphs as matroid circuits
inferred← citeshttps://doi.org/10.1016/0095-8956(85)90057-7openalex-snapshot
Connectivity in bicircular matroids
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90051-7openalex-snapshot
The biased graphs whose matroids are binary
inferred← citeshttps://doi.org/10.1016/0095-8956(89)90063-4openalex-snapshot
Biased graphs. I. Bias, balance, and gains
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90096-iopenalex-snapshot
Symmetric 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/0166-218x(89)90017-6openalex-snapshot
The structure of bases in bicircular matroids
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90001-dopenalex-snapshot
Representations of bicircular matroids
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90103-uopenalex-snapshot
Uncovering generalized-network structure in matrices
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90112-2openalex-snapshot
Recognizing a class of bicircular matroids
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90243-hopenalex-snapshot
Recognizing hidden bicircular networks
inferred← citeshttps://doi.org/10.1016/j.disc.2014.03.022openalex-snapshot
Bicircular signed-graphic matroids
inferred← citeshttps://doi.org/10.1016/j.disc.2015.12.015openalex-snapshot
Bicircular matroids are 3-colorable
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.07.011openalex-snapshot
Distributive lattices, polyhedra, and generalized flows
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.ejc.2026.104419openalex-snapshot
Excluding a line from positroids
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.03.001openalex-snapshot
Biased graphs. VII. Contrabalance and antivoltages
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70394-7openalex-snapshot
From Random Graphs to Graph Theory
inferred← citeshttps://doi.org/10.1016/s0195-6698(86)80032-4openalex-snapshot
Graphes Équilibrés et Arboricité Rationnelle
inferred← citeshttps://doi.org/10.1017/s0963548305006838openalex-snapshot
Inequivalent Representations of Bias Matroids
inferred← citeshttps://doi.org/10.1090/s0002-9939-1973-0314663-6openalex-snapshot
On matroids on edge sets of graphs with connected subgraphs as circuits
inferred← citeshttps://doi.org/10.1090/s0002-9947-1989-0957084-1openalex-snapshot
A Generalisation of the Matroid Lift Construction
inferred← citeshttps://doi.org/10.1112/blms.70159openalex-snapshot
Girth in GF(q)$\textsf {GF}(q)$‐representable matroids
inferred← citeshttps://doi.org/10.1137/18m1177809openalex-snapshot
A Ramsey Theorem for Biased Graphs
inferred← citeshttps://doi.org/10.26686/wgtn.17147858openalex-snapshot
On matroids that are transversal and cotransversal
inferred← citeshttps://doi.org/10.26686/wgtn.17147858.v1openalex-snapshot
On matroids that are transversal and cotransversal
inferred← citeshttps://doi.org/10.31274/rtd-180813-12666openalex-snapshot
Efficient processing of hierarchical graphs
inferred← citeshttps://doi.org/10.3982/te4723openalex-snapshot
On the revealed preference analysis of stable aggregate matchings
inferred← citeshttps://doi.org/10.48550/arxiv.0811.1541openalex-snapshot
Distributive Lattices, Polyhedra, and Generalized Flow
inferred← citeshttps://doi.org/10.48550/arxiv.1910.05390openalex-snapshot
The Maximum Matroid of a Graph
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.