On the public citation graph
Ear-decompositions of matching-covered graphs
0 signed · 107 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.1016/0012-365x(78)90108-5openalex-snapshot
Regularisable graphs, II
inferredcites →https://doi.org/10.1016/0012-365x(79)90066-9openalex-snapshot
Independence numbers of graphs-an extension of the Koenig-Egervary theorem
inferredcites →https://doi.org/10.1016/0095-8956(77)90062-4openalex-snapshot
On minimal elementary bipartite graphs
inferredcites →https://doi.org/10.1016/0095-8956(79)90085-6openalex-snapshot
A characterization of the graphs in which the transversal number equals the matching number
inferredcites →https://doi.org/10.1016/s0304-0208(08)72455-1openalex-snapshot
Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings
inferredcites →https://doi.org/10.1017/s144678870002913xopenalex-snapshot
A theorem on connected graphs in which every edge belongs to a 1-factor
inferredcites →https://doi.org/10.1090/s0002-9939-1953-0063009-7openalex-snapshot
The 1-Factors of Oriented Graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1970-0252415-3openalex-snapshot
A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices
inferredcites →https://doi.org/10.4153/cjm-1965-072-1openalex-snapshot
A Theorem on k-Saturated 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.21882openalex-snapshot
K4‐free and ‐free Planar Matching Covered Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22411openalex-snapshot
On perfect matchings in matching covered graphs
inferred← citeshttps://doi.org/10.1002/jgt.22555openalex-snapshot
On nonfeasible edge sets in matching‐covered graphs
inferred← citeshttps://doi.org/10.1002/jgt.22579openalex-snapshot
Generating simple near‐bipartite bricks
inferred← citeshttps://doi.org/10.1002/jgt.22627openalex-snapshot
The maximum number of maximum dissociation sets in trees
inferred← citeshttps://doi.org/10.1002/jgt.23288openalex-snapshot
Wheel‐Like Bricks and Minimal 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.1007/978-3-032-17156-6_29openalex-snapshot
Matching Extendability in Cartesian Product of Hypercubes and Paths
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_73openalex-snapshot
König Deletion Sets and Vertex Covers above the Matching Size
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_18openalex-snapshot
Min-Max Results in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/s00373-011-1037-yopenalex-snapshot
Critical Independent Sets and König–Egerváry Graphs
inferred← citeshttps://doi.org/10.1007/s00373-022-02534-7openalex-snapshot
Some More Updates on an Annihilation Number Conjecture: Pros and Cons
inferred← citeshttps://doi.org/10.1007/s00373-023-02690-4openalex-snapshot
On Critical Difference, Independence Number and Matching Number of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-024-02769-6openalex-snapshot
Removable Edges in Claw-Free Bricks
inferred← citeshttps://doi.org/10.1007/s00453-010-9412-2openalex-snapshot
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover
inferred← citeshttps://doi.org/10.1007/s00493-026-00211-4openalex-snapshot
Two Disjoint Alternating Paths in Bipartite Graphs: Conformal Crosses
inferred← citeshttps://doi.org/10.1007/s10878-015-9875-9openalex-snapshot
Computing unique maximum matchings in $$O(m)$$ O ( m ) time for König–Egerváry graphs and unicyclic graphs
inferred← citeshttps://doi.org/10.1007/s11424-010-7122-0openalex-snapshot
Removable ears of 1-extendable graphs
inferred← citeshttps://doi.org/10.1007/s40590-025-00796-8openalex-snapshot
On König–Egerváry corona 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/0095-8956(87)90021-9openalex-snapshot
Matching structure and the matching lattice
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90041-xopenalex-snapshot
Matching extension and the genus of a graph
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90273-dopenalex-snapshot
König-Egerváry graphs, 2-bicritical graphs and fractional matchings
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.artint.2015.10.002openalex-snapshot
Automated conjecturing I: Fajtlowicz's Dalmatian heuristic revisited
inferred← citeshttps://doi.org/10.1016/j.dam.2011.05.011openalex-snapshot
Nash-solvable two-person symmetric cycle game forms
inferred← citeshttps://doi.org/10.1016/j.dam.2013.01.005openalex-snapshot
On maximum matchings in König–Egerváry graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.04.020openalex-snapshot
Forbidden subgraphs and the König–Egerváry property
inferred← citeshttps://doi.org/10.1016/j.dam.2016.05.012openalex-snapshot
Two more characterizations of König–Egerváry graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.042openalex-snapshot
Combinatorial and spectral properties of König–Egerváry graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.058openalex-snapshot
Critical and maximum independent sets of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2019.01.005openalex-snapshot
Ear decomposition and induced even cycles
inferred← citeshttps://doi.org/10.1016/j.dam.2021.07.034openalex-snapshot
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
inferred← citeshttps://doi.org/10.1016/j.dam.2022.04.014openalex-snapshot
Critical independent sets of König–Egerváry graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.01.030openalex-snapshot
Removable edges in Halin graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.12.013openalex-snapshot
On saturated non-covered 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.08.013openalex-snapshot
Even cycles and perfect matchings in planar graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.12.039openalex-snapshot
On the Kőnig–Egerváry index of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2026.08.028openalex-snapshot
Excluded conformal minors of Birkhoff–von Neumann graphs with equal global forcing number and maximum anti-forcing number
inferred← citeshttps://doi.org/10.1016/j.disc.2015.09.014openalex-snapshot
A characterization of minimal non-Seymour graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114370openalex-snapshot
Determinantal decomposition of graphs with a unique perfect matching
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114553openalex-snapshot
Nice vertices in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.030openalex-snapshot
A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2011.05.057openalex-snapshot
Forbidden subgraphs and the Kőnig property
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.092openalex-snapshot
A Characterization of König–Egerváry Graphs Using a Common Property of All Maximum Matchings
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2025.05.006openalex-snapshot
Regularity of normal Rees algebras of edge ideals of 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.tcs.2017.06.008openalex-snapshot
On approximability of optimization problems related to Red/Blue-split graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00528-9openalex-snapshot
On α+-stable König–Egerváry graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00102-xopenalex-snapshot
Reducible chains of planar 1-cycle resonant graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00577-2openalex-snapshot
Planar k-cycle resonant graphs with k=1,2
inferred← citeshttps://doi.org/10.1016/s0166-8641(01)00217-6openalex-snapshot
Reduced 2-to-1 maps and decompositions of graphs with no 2-to-1 cut sets
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70395-9openalex-snapshot
Matching and Vertex Packing: How “hard” are They?
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70473-4openalex-snapshot
A Theorem on Matchings in the Plane
inferred← citeshttps://doi.org/10.1080/16073606.1993.9631737openalex-snapshot
WELL-COVERED GRAPHS: A SURVEY
inferred← citeshttps://doi.org/10.1090/tran/9212openalex-snapshot
A general formula for the index of depth stability of edge ideals
inferred← citeshttps://doi.org/10.1109/sfcs.1985.16openalex-snapshot
Computing ears and branchings in parallel
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb16422.xopenalex-snapshot
Some Recent Results on Graph Matchinga
inferred← citeshttps://doi.org/10.1137/17m1138704openalex-snapshot
On Two Unsolved Problems Concerning Matching Covered Graphs
inferred← citeshttps://doi.org/10.1145/1103963.1103969openalex-snapshot
An O ( VE ) algorithm for ear decompositions of matching-covered graphs
inferred← citeshttps://doi.org/10.2139/ssrn.5404413openalex-snapshot
On the K\H{O}Nig-Egerv\'{A}Ry Index of a Graph
inferred← citeshttps://doi.org/10.23638/dmtcs-22-4-6openalex-snapshot
Even cycles and perfect matchings in claw-free plane graphs
inferred← citeshttps://doi.org/10.37236/2657openalex-snapshot
Matching Covered Graphs with Three Removable Classes
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.4171/022-3/47openalex-snapshot
A survey of Pfaffian orientations of graphs
inferred← citeshttps://doi.org/10.47749/t/unicamp.1997.115905openalex-snapshot
Decomposição otima em orelhas para grafos matching covered
inferred← citeshttps://doi.org/10.47749/t/unicamp.2006.375289openalex-snapshot
Orientações pfaffianas e o furtivo grafo de Heawood
inferred← citeshttps://doi.org/10.48550/arxiv.0906.4609openalex-snapshot
Critical independent sets and Konig--Egervary graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0908.1313openalex-snapshot
On Konig-Egervary Square-Stable Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0911.4626openalex-snapshot
A characterization of Konig-Egervary graphs using a common property of all maximum matchings
inferred← citeshttps://doi.org/10.48550/arxiv.1102.1141openalex-snapshot
An Algorithm Computing the Core of a Konig-Egervary Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1105.1764openalex-snapshot
Generating p-extremal graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1402.2903openalex-snapshot
Computing Unique Maximum Matchings in O(m) time for Konig-Egervary Graphs and Unicyclic Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1510.07553openalex-snapshot
Even Orientations and Pfaffian graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1911.08154openalex-snapshot
The maximum number of maximum dissociation sets in trees
inferred← citeshttps://doi.org/10.5555/1070432.1070490openalex-snapshot
An O(VE) algorithm for ear decompositions of matching-covered graphs
inferred← citeshttps://doi.org/10.5555/1109557.1109650openalex-snapshot
Subgraph characterization of red/blue-split graph and konig egerváry graphs
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.