On the public citation graph
Recognizing graphic matroids
0 signed · 96 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.1016/s0021-9800(68)80054-7openalex-snapshot
Strong maps of geometries
inferredcites →https://doi.org/10.1017/s0305004100056498openalex-snapshot
The computational complexity of matroid properties
inferredcites →https://doi.org/10.1090/s0002-9939-1960-0117173-5openalex-snapshot
An Algorithm for Determining Whether a Given Binary Matroid is Graphic
inferredcites →https://doi.org/10.1137/0211014openalex-snapshot
Complexity of Matroid Property Algorithms
inferredcites →https://doi.org/10.1287/moor.5.3.321openalex-snapshot
Converting Linear Programs to Network Problems
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.22141openalex-snapshot
On Recognizing Frame and Lifted‐Graphic Matroids
inferred← citeshttps://doi.org/10.1002/jgt.22143openalex-snapshot
Retraction: ‘Quasi‐Graphic Matroids’ by J. Geelen, B. Gerards and G. Whittle
inferred← citeshttps://doi.org/10.1002/net.3230130306openalex-snapshot
An algorithm for constructing edge‐trees from hypergraphs
inferred← citeshttps://doi.org/10.1006/aama.2000.0704openalex-snapshot
The Computational Complexity of Antimatroid Properties
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_74openalex-snapshot
A survey on oracle techniques
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_53openalex-snapshot
On combinatorial properties of binary spaces
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_15openalex-snapshot
Recognizing Even-Cycle and Even-Cut Matroids
inferred← citeshttps://doi.org/10.1007/978-3-032-28691-8_26openalex-snapshot
Arithmetic Circuits and Neural Networks for Regular Matroids
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_23openalex-snapshot
Amalgam Width of Matroids
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_20openalex-snapshot
Computing Representations of Matroids of Bounded Branch-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_6openalex-snapshot
Decomposition Width of Matroids
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_24openalex-snapshot
Deciding First Order Properties of Matroids
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/bf01844845openalex-snapshot
Independence and port oracles for matroids, with an application to computational learning theory
inferred← citeshttps://doi.org/10.1007/bf02579257openalex-snapshot
Counterexamples to conjectures on 4-connected matroids
inferred← citeshttps://doi.org/10.1007/bf02579300openalex-snapshot
Finding a small 3-connected minor maintaining a fixed minor and a fixed element
inferred← citeshttps://doi.org/10.1007/bfb0120924openalex-snapshot
Algorithmic versus axiomatic definitions of matroids
inferred← citeshttps://doi.org/10.1007/s00373-015-1555-0openalex-snapshot
Excluded Minors for Matroids Satisfying Kinser’s Inequalities
inferred← citeshttps://doi.org/10.1007/s00493-024-00118-yopenalex-snapshot
A Whitney Type Theorem for Surfaces: Characterising Graphs with Locally Planar Embeddings
inferred← citeshttps://doi.org/10.1007/s00493-024-00119-xopenalex-snapshot
Reconstruction in One Dimension from Unlabeled Euclidean Lengths
inferred← citeshttps://doi.org/10.1007/s10107-023-01944-6openalex-snapshot
Recognizing even-cycle and even-cut matroids
inferred← citeshttps://doi.org/10.1007/s10107-023-01950-8openalex-snapshot
Small separations in pinch-graphic matroids
inferred← citeshttps://doi.org/10.1007/s11590-023-02066-wopenalex-snapshot
A mathematical programming approach for recognizing binet matrices
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90119-7openalex-snapshot
Chordal characterization of graphic matroids
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90265-hopenalex-snapshot
Characterizing bias matroids
inferred← citeshttps://doi.org/10.1016/0024-3795(82)90244-0openalex-snapshot
Separating cocircuits in binary matroids
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90025-uopenalex-snapshot
A characterization of a class of non-binary matroids
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90112-2openalex-snapshot
Recognizing a class of bicircular matroids
inferred← citeshttps://doi.org/10.1016/b978-0-12-566780-7.50009-xopenalex-snapshot
Recent Algorithms for Two Versions of Graph Realization and Remarks on Applications to Linear Programming
inferred← citeshttps://doi.org/10.1016/b978-0-12-701225-4.50017-3openalex-snapshot
RETRACTED: References
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50013-0openalex-snapshot
10.1016/b978-044488002-4/50013-0
inferred← citeshttps://doi.org/10.1016/j.aam.2008.05.002openalex-snapshot
Some open problems on excluding a uniform matroid
inferred← citeshttps://doi.org/10.1016/j.aam.2013.02.001openalex-snapshot
Inequivalent representations of matroids over prime fields
inferred← citeshttps://doi.org/10.1016/j.aam.2026.103078openalex-snapshot
The excluded minors for the class of spike minors
inferred← citeshttps://doi.org/10.1016/j.dam.2011.03.016openalex-snapshot
Decomposition width of matroids
inferred← citeshttps://doi.org/10.1016/j.disc.2004.07.039openalex-snapshot
Recent work in matroid representation theory
inferred← citeshttps://doi.org/10.1016/j.disc.2017.07.026openalex-snapshot
Signed-graphic matroids with all-graphic cocircuits
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111887openalex-snapshot
Binary signed-graphic matroids: Representations and recognition algorithms
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112093openalex-snapshot
Recognising graphic and matroidal connectivity functions
inferred← citeshttps://doi.org/10.1016/j.ejc.2003.09.019openalex-snapshot
Geometric graphs with no self-intersecting path of length three
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.04.005openalex-snapshot
Displaying blocking pairs in signed graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.08.005openalex-snapshot
First order convergence of matroids
inferred← citeshttps://doi.org/10.1016/j.jctb.2003.11.001openalex-snapshot
A short proof of non-GF(5)-representability of matroids
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.02.005openalex-snapshot
Excluding a planar graph from GF(q) -representable matroids
inferred← citeshttps://doi.org/10.1016/j.jctb.2008.08.004openalex-snapshot
The Erdös–Pósa property for matroid circuits
inferred← citeshttps://doi.org/10.1016/j.jctb.2008.12.003openalex-snapshot
On excluded minors for real-representability
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.11.005openalex-snapshot
Certifying non-representability of matroids over prime fields
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.03.005openalex-snapshot
Excluding Kuratowski graphs and their duals from binary matroids
inferred← citeshttps://doi.org/10.1016/j.jctb.2026.01.003openalex-snapshot
Rigidity and reconstruction in matroids of highly connected graphs
inferred← citeshttps://doi.org/10.1016/j.jet.2025.106131openalex-snapshot
Random allocations of multiple objects with incomplete information
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.006openalex-snapshot
Trees, grids, and MSO decidability: From graphs to matroids
inferred← citeshttps://doi.org/10.1016/s0195-6698(82)80039-5openalex-snapshot
On the Efficiency of Representability Tests for Matroids
inferred← citeshttps://doi.org/10.1016/s0195-6698(88)80038-6openalex-snapshot
Adjoints of Binary Matroids
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00167-7openalex-snapshot
Computational implementation of Fujishige's graph realizability algorithm
inferred← citeshttps://doi.org/10.1017/s0305004100056498openalex-snapshot
The computational complexity of matroid properties
inferred← citeshttps://doi.org/10.1017/s0963548300000882openalex-snapshot
Recognizing Polymatroids Associated with Hypergraphs
inferred← citeshttps://doi.org/10.1051/ro/1993270302931openalex-snapshot
Décomposition en matrices graphiques de matrices en $\lbrace 0, 1, -1\rbrace $ : application à la résolution de programmes linéaires entiers
inferred← citeshttps://doi.org/10.1109/tit.2017.2740283openalex-snapshot
The “Art of Trellis Decoding” Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1137/0211014openalex-snapshot
Complexity of Matroid Property Algorithms
inferred← citeshttps://doi.org/10.1137/050640576openalex-snapshot
Matroid Complexity and Nonsuccinct Descriptions
inferred← citeshttps://doi.org/10.1137/090759616openalex-snapshot
An Obstacle to a Decomposition Theorem for Near-Regular Matroids
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch116openalex-snapshot
Constructive algorithm for path-width of matroids
inferred← citeshttps://doi.org/10.1137/1.9781611974782.93openalex-snapshot
Spanning Circuits in Regular Matroids
inferred← citeshttps://doi.org/10.1137/110852383openalex-snapshot
The Complexity of Deletion Problems for Matroids
inferred← citeshttps://doi.org/10.1137/130937937openalex-snapshot
Matroids with a Modular 4-Point Line
inferred← citeshttps://doi.org/10.1137/17m1151250openalex-snapshot
Covering Vectors by Spaces: Regular Matroids
inferred← citeshttps://doi.org/10.1145/3355629openalex-snapshot
Spanning Circuits in Regular Matroids
inferred← citeshttps://doi.org/10.11606/d.45.1990.tde-20220712-113724openalex-snapshot
Estrutura grafica de matrizes
inferred← citeshttps://doi.org/10.1287/moor.5.3.321openalex-snapshot
Converting Linear Programs to Network Problems
inferred← citeshttps://doi.org/10.26686/wgtn.12027042openalex-snapshot
Excluding Kuratowski graphs and their duals from binary matroids
inferred← citeshttps://doi.org/10.26686/wgtn.12027042.v1openalex-snapshot
Excluding Kuratowski graphs and their duals from binary matroids
inferred← citeshttps://doi.org/10.26686/wgtn.17005114openalex-snapshot
Matroids, Complexity and Computation
inferred← citeshttps://doi.org/10.26686/wgtn.17005114.v1openalex-snapshot
Matroids, Complexity and Computation
inferred← citeshttps://doi.org/10.3390/sym17101628openalex-snapshot
Fuzzy Graphic Binary Matroid Approach to Power Grid Communication Network Analysis
inferred← citeshttps://doi.org/10.4171/022-3/41openalex-snapshot
Towards a structure theory for matrices and matroids
inferred← citeshttps://doi.org/10.4171/jems/1119openalex-snapshot
Correlation bounds for fields and matroids
inferred← citeshttps://doi.org/10.48550/arxiv.0904.2785openalex-snapshot
Decomposition width - a new width parameter for matroids
inferred← citeshttps://doi.org/10.48550/arxiv.0905.3252openalex-snapshot
An obstacle to a decomposition theorem for near-regular 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.1108.5457openalex-snapshot
Deciding first order logic properties of matroids
inferred← citeshttps://doi.org/10.48550/arxiv.1212.1056openalex-snapshot
Geometric representations of binary codes embeddable in three dimensions
inferred← citeshttps://doi.org/10.48550/arxiv.1601.01791openalex-snapshot
On recognising frame and lifted-graphic matroids
inferred← citeshttps://doi.org/10.48550/arxiv.2010.08988openalex-snapshot
Even Circuits in Oriented Matroids
inferred← citeshttps://doi.org/10.82444/warw.33712975openalex-snapshot
Parameterized complexity : permutation patterns, graph arrangements, and matroid parameters
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.