On the public citation graph
Brick decompositions and the matching rank of graphs
0 signed · 131 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.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/bf01581025openalex-snapshot
Rank of maximum matchings in a graph
inferredcites →https://doi.org/10.1007/bf01889914openalex-snapshot
On the structure of factorizable graphs
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1016/0012-365x(81)90006-6openalex-snapshot
Matchings in regular graphs
inferredcites →https://doi.org/10.1016/0095-8956(80)90074-xopenalex-snapshot
On maximal independent sets of vertices in claw-free graphs
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
inferredcites →https://doi.org/10.6028/jres.071b.033openalex-snapshot
Systems of distinct representatives and linear algebra
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4602258openalex-extracted
Cubic Vertices of Minimal Bicritical Graphs1
inferred← citeshttps://doi.org/10.1002/jgt.20036openalex-snapshot
Graphs with independent perfect matchings
inferred← citeshttps://doi.org/10.1002/jgt.21747openalex-snapshot
The Cubic Vertices of Minimal Bricks
inferred← citeshttps://doi.org/10.1002/jgt.21882openalex-snapshot
K4‐free and ‐free Planar Matching Covered Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22579openalex-snapshot
Generating simple near‐bipartite bricks
inferred← citeshttps://doi.org/10.1002/jgt.23026openalex-snapshot
Minimal bricks with the maximum number of edges
inferred← citeshttps://doi.org/10.1002/jgt.23173openalex-snapshot
Removable edges in near‐bipartite bricks
inferred← citeshttps://doi.org/10.1002/jgt.23190openalex-snapshot
Basilica: New canonical decomposition in matching theory
inferred← citeshttps://doi.org/10.1002/jgt.23288openalex-snapshot
Wheel‐Like Bricks and Minimal Matching Covered Graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190090103openalex-snapshot
Factors and factorizations of graphs—a survey
inferred← citeshttps://doi.org/10.1002/jgt.70078openalex-snapshot
b‐Invariant Edges in Near‐Bipartite Bricks
inferred← citeshttps://doi.org/10.1002/jgt.70128openalex-snapshot
Characterization of graphs without even F-orientations
inferred← citeshttps://doi.org/10.1006/eujc.2001.0505openalex-snapshot
On Generalizations of Matching-covered Graphs
inferred← citeshttps://doi.org/10.1006/jctb.1996.0019openalex-snapshot
Matching Covered Graphs and Subdivisions ofK4and[formula]
inferred← citeshttps://doi.org/10.1006/jctb.2001.2090openalex-snapshot
Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_17openalex-snapshot
On the Chvátal Rank of Certain Inequalities
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-3-031-93112-3_1openalex-snapshot
Strongly Connected Orientations and Integer Lattices
inferred← citeshttps://doi.org/10.1007/978-3-032-28691-8_14openalex-snapshot
Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations
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-76796-1_2openalex-snapshot
Facet Generating Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-85221-6_14openalex-snapshot
Recent Progress in Matching Extension
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-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-642-68874-4_13openalex-snapshot
Polyhedral Combinatorics
inferred← citeshttps://doi.org/10.1007/bf02122558openalex-snapshot
The Schrijver system of odd join polyhedra
inferred← citeshttps://doi.org/10.1007/s00373-005-0858-yopenalex-snapshot
Grid Graphs, Gorenstein Polytopes, and Domino Stackings
inferred← citeshttps://doi.org/10.1007/s00373-024-02769-6openalex-snapshot
Removable Edges in Claw-Free Bricks
inferred← citeshttps://doi.org/10.1007/s00373-026-03071-3openalex-snapshot
On Nonsolid Sub-extremal Bricks
inferred← citeshttps://doi.org/10.1007/s00493-008-2231-2openalex-snapshot
Pfaffian labelings and signs of edge colorings
inferred← citeshttps://doi.org/10.1007/s10479-010-0828-5openalex-snapshot
A branch-and-cut procedure for the Udine Course Timetabling problem
inferred← citeshttps://doi.org/10.1007/s10852-010-9133-1openalex-snapshot
An Algorithm to Find the Lineality Space of the Positive Hull of a Set of Vectors
inferred← citeshttps://doi.org/10.1007/s11424-010-7122-0openalex-snapshot
Removable ears of 1-extendable graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90221-xopenalex-snapshot
Toughness and matching extension in graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00485-aopenalex-snapshot
Extending matchings in graphs: A survey
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90640-2openalex-snapshot
Matching theory—a sampler: from Dénes König to the present
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90021-9openalex-snapshot
Matching structure and the matching lattice
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90062-5openalex-snapshot
Undirected distances and the postman-structure of graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(93)00094-gopenalex-snapshot
An algorithm for fractional assignment problems
inferred← citeshttps://doi.org/10.1016/b978-0-12-566780-7.50016-7openalex-snapshot
Geometric Methods in Combinatorial Optimization
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/50004-xopenalex-snapshot
10.1016/b978-044488002-4/50004-x
inferred← citeshttps://doi.org/10.1016/j.aim.2011.03.015openalex-snapshot
Exponentially many perfect matchings in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2009.06.018openalex-snapshot
A Matlab-based rapid method for computing lattice-subspaces and vector sublattices of : Applications in portfolio insurance
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.05.003openalex-snapshot
Randomly colouring graphs (a combinatorial view)
inferred← citeshttps://doi.org/10.1016/j.dam.2022.01.010openalex-snapshot
Relations between global forcing number and maximum anti-forcing number of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2022.04.026openalex-snapshot
Bicritical graphs without removable edges
inferred← citeshttps://doi.org/10.1016/j.dam.2022.08.024openalex-snapshot
Graft Analogue of general Kotzig–Lovász decomposition
inferred← citeshttps://doi.org/10.1016/j.dam.2024.03.018openalex-snapshot
Cubic vertices of minimal bicritical graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.02.044openalex-snapshot
K 4 -free planar minimal bricks with the maximum number of edges
inferred← citeshttps://doi.org/10.1016/j.dam.2025.02.045openalex-snapshot
Claw-free minimal matching covered graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.022openalex-snapshot
Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs — A survey
inferred← citeshttps://doi.org/10.1016/j.dam.2026.07.009openalex-snapshot
Cubic vertices of minimal matching covered graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.025openalex-snapshot
Construction for bicritical graphs and k-extendable bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2013.05.024openalex-snapshot
Average connectivity and average edge-connectivity in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112876openalex-snapshot
On cycle-nice claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113746openalex-snapshot
The cubic vertices of solid minimal bricks
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113839openalex-snapshot
Minimum degree of minimal (n-10)-factor-critical graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114365openalex-snapshot
The number of perfect matchings in a brick
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114581openalex-snapshot
Covering the edges of r-graphs with perfect matchings
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.11.008openalex-snapshot
An improved linear bound on the number of perfect matchings in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.027openalex-snapshot
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.06.045openalex-snapshot
Minimal bricks have many vertices of small degree
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.05.005openalex-snapshot
Erdős–Ko–Rado for perfect matchings
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.068openalex-snapshot
Cubic bridgeless graphs have more than a linear number of perfect matchings
inferred← citeshttps://doi.org/10.1016/j.endm.2013.10.015openalex-snapshot
Small degree vertices in minimal bricks
inferred← citeshttps://doi.org/10.1016/j.endm.2017.06.080openalex-snapshot
Matching Connectivity: On the Structure of Graphs with Perfect Matchings
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.12.005openalex-snapshot
Minimally non-Pfaffian graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.07.004openalex-snapshot
A generalization of Littleʼs Theorem on Pfaffian orientations
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.05.003openalex-snapshot
Laminar tight cuts in matching covered graphs
inferred← citeshttps://doi.org/10.1016/j.jsc.2015.06.001openalex-snapshot
Efficient edge-skeleton computation for polytopes defined by oracles
inferred← citeshttps://doi.org/10.1016/j.laa.2005.07.017openalex-snapshot
Permutohedra and minimal matrices
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.02.023openalex-snapshot
Three-matching intersection conjecture for perfect matching polytopes of small dimensions
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00060-7openalex-snapshot
Towards a characterisation of Pfaffian near bipartite graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00291-9openalex-snapshot
Perfect matchings and ears in elementary bipartite graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70798-2openalex-snapshot
Toughness and Matching Extension in Graphs
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01006-6openalex-snapshot
Chapter V Polyhedral combinatorics
inferred← citeshttps://doi.org/10.1051/ita:2005005openalex-snapshot
On the number of dissimilar pfaffian orientations of graphs
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb16422.xopenalex-snapshot
Some Recent Results on Graph Matchinga
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb16425.xopenalex-snapshot
On the Star Packing Problem
inferred← citeshttps://doi.org/10.1137/0220044openalex-snapshot
On Counting Lattice Points in Polyhedra
inferred← citeshttps://doi.org/10.1137/080723843openalex-snapshot
A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs
inferred← citeshttps://doi.org/10.1137/17m1138704openalex-snapshot
On Two Unsolved Problems Concerning Matching Covered Graphs
inferred← citeshttps://doi.org/10.1137/18m1185296openalex-snapshot
Disjoint Odd Cycles in Cubic Solid Bricks
inferred← citeshttps://doi.org/10.1137/18m1202347openalex-snapshot
Birkhoff--von Neumann Graphs that are PM-Compact
inferred← citeshttps://doi.org/10.13189/ms.2013.010305openalex-snapshot
On r-Edge-Connected r-Regular Bricks and Braces and Inscribability
inferred← citeshttps://doi.org/10.2139/ssrn.6333080openalex-snapshot
The minimum degree of minimal 2-extendable claw-free graphs
inferred← citeshttps://doi.org/10.37236/8594openalex-snapshot
On Essentially 4-Edge-Connected Cubic Bricks
inferred← citeshttps://doi.org/10.37236/8945openalex-snapshot
$b$-Invariant Edges in Essentially 4-Edge-Connected Near-Bipartite Cubic Bricks
inferred← citeshttps://doi.org/10.3934/math.2022201openalex-snapshot
A note on PM-compact $ K_4 $-free bricks
inferred← citeshttps://doi.org/10.4310/joc.2018.v9.n1.a8openalex-snapshot
On tight cuts in matching covered graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.11747openalex-snapshot
A note on removable edges in near-bricks
inferred← citeshttps://doi.org/10.46298/dmtcs.6013openalex-snapshot
A note on tight cuts in matching-covered graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.633openalex-snapshot
A bound on the number of perfect matchings in Klee-graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0906.3873openalex-snapshot
Perfect matchings of line graphs with small maximum degree
inferred← citeshttps://doi.org/10.48550/arxiv.1512.08870openalex-snapshot
A Graph Theoretic Proof of the Tight Cut Lemma
inferred← citeshttps://doi.org/10.48550/arxiv.1704.00493openalex-snapshot
Matching Connectivity: On the Structure of Graphs with Perfect Matchings
inferred← citeshttps://doi.org/10.48550/arxiv.1812.05461openalex-snapshot
The Tight Cut Decomposition of Matching Covered Uniformable Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2105.11167openalex-snapshot
Constructive Characterization of Critical Bipartite Grafts
inferred← citeshttps://doi.org/10.48550/arxiv.math/9909026openalex-snapshot
Towards a characterisation of Pfaffian graphs
inferred← citeshttps://doi.org/10.5772/intechopen.83925openalex-snapshot
Computational and Mathematical Methods in Portfolio Insurance - a MATLAB-Based Approach
inferred← citeshttps://doi.org/10.7151/dmgt.1338openalex-snapshot
Some recent results on domination in graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2001openalex-snapshot
Core index of perfect matching polytope for a 2-connected cubic 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.