On the public citation graph

On a matroid defined by ear-decompositions of graphs

https://doi.org/10.1007/bf01844849
0 signed · 23 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-3-662-22143-3openalex-snapshot
Matroid Theory and its Applications in Electric Network Theory and in Statics
inferredcites →https://doi.org/10.1007/bf01202790openalex-snapshot
Conservative weightings and ear-decompositions of graphs

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.23190openalex-snapshot
Basilica: New canonical decomposition in matching theory
inferred← citeshttps://doi.org/10.1002/net.20008openalex-snapshot
Packing cuts in undirected graphs
inferred← citeshttps://doi.org/10.1006/eujc.2001.0505openalex-snapshot
On Generalizations of Matching-covered Graphs
inferred← citeshttps://doi.org/10.1007/3-540-29297-7_10openalex-snapshot
Maximum Matchings
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_31openalex-snapshot
On Optimal Ear-Decompositions of Graphs
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_10openalex-snapshot
Couplage maximum
inferred← citeshttps://doi.org/10.1007/978-3-319-71150-8_20openalex-snapshot
Structure of Towers and a New Proof of the Tight Cut Lemma
inferred← citeshttps://doi.org/10.1007/978-3-540-71844-4_10openalex-snapshot
Maximum Matchings
inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_10openalex-snapshot
Maximale Matchings
inferred← citeshttps://doi.org/10.1007/978-3-540-93952-8openalex-snapshot
Graph Factors and Matching Extensions
inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_10openalex-snapshot
Maximum Matchings
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_10openalex-snapshot
Kardinalitätsmaximale Matchings
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_12openalex-snapshot
A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings
inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_10openalex-snapshot
Maximum Matchings
inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_10openalex-snapshot
Maximum Matchings
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_10openalex-snapshot
Maximum Matchings
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_10openalex-snapshot
Kardinalitätsmaximale Matchings
inferred← citeshttps://doi.org/10.1007/978-88-470-1523-4_10openalex-snapshot
Matching Massimo
inferred← citeshttps://doi.org/10.1007/s00493-006-0020-3openalex-snapshot
Symplectic Spaces And Ear-Decomposition Of Matroids
inferred← citeshttps://doi.org/10.1080/00927872.2025.2459250openalex-snapshot
Irreducible decomposition of powers of edge ideals, computing dstab, astab.
inferred← citeshttps://doi.org/10.11606/d.45.1999.tde-20210729-205403openalex-snapshot
T-junções, T-cortes e funções conservativas
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.