On the public citation graph
Testing balancedness and perfection of linear matrices
0 signed · 43 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/bf01581189openalex-snapshot
Properties of balanced and perfect matrices
inferredcites →https://doi.org/10.1007/bf01581196openalex-snapshot
Structural properties and decomposition of linear balanced matrices
inferredcites →https://doi.org/10.1007/bf01589107openalex-snapshot
Odd cycles and matrices with integrality properties
inferredcites →https://doi.org/10.1007/bf02591849openalex-snapshot
Structural properties and recognition of restricted and strongly unimodular matrices
inferredcites →https://doi.org/10.1016/0012-365x(92)90623-nopenalex-snapshot
Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets
inferredcites →https://doi.org/10.1016/0012-365x(92)90701-gopenalex-snapshot
Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations
inferredcites →https://doi.org/10.1016/0020-0190(81)90072-7openalex-snapshot
An algorithm for finding clique cut-sets
inferredcites →https://doi.org/10.1016/0095-8956(75)90041-6openalex-snapshot
On certain polytopes associated with graphs
inferredcites →https://doi.org/10.1016/0095-8956(79)90047-9openalex-snapshot
The validity of the strong perfect-graph conjecture for (K4−e)-free graphs
inferredcites →https://doi.org/10.1016/0095-8956(87)90048-7openalex-snapshot
Coloring perfect (K4 − e)-free graphs
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1287/moor.10.2.280openalex-snapshot
On a Class of Totally Unimodular Matrices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jctb.1999.1932openalex-snapshot
Decomposition of Balanced Matrices
inferred← citeshttps://doi.org/10.1007/978-3-319-53139-7_1openalex-snapshot
Covering, Coloring, and Packing Hypergraphs
inferred← citeshttps://doi.org/10.1007/bf01581189openalex-snapshot
Properties of balanced and perfect matrices
inferred← citeshttps://doi.org/10.1007/s10107-005-0647-7openalex-snapshot
Recognizing Balanceable Matrices
inferred← citeshttps://doi.org/10.1016/j.disc.2009.05.024openalex-snapshot
The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.02.006openalex-snapshot
A polynomial recognition algorithm for balanced matrices
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.10.001openalex-snapshot
Decomposition of even-hole-free graphs with star cutsets and 2-joins
inferred← citeshttps://doi.org/10.1017/cbo9780511666209.005openalex-snapshot
Excluding induced subgraphs
inferred← citeshttps://doi.org/10.1017/cbo9781139506748.008openalex-snapshot
The world of hereditary graph classes viewed through Truemper configurations
inferred← citeshttps://doi.org/10.1080/00036811.2017.1336547openalex-snapshot
Generalized -D-gap functions and error bounds for a class of equilibrium problems
inferred← citeshttps://doi.org/10.1137/140981496openalex-snapshot
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
inferred← citeshttps://doi.org/10.2298/aadm100812027vopenalex-snapshot
Even-hole-free graphs: A survey
inferred← citeshttps://doi.org/10.5555/314464.314484openalex-snapshot
Recognizing balanced 0,±matrices
inferred← citeshttps://doi.org/10.5860/choice.39-4018openalex-snapshot
Combinatorial optimization: packing and covering
inferred← citeshttps://doi.org/10.70675/42e4b45bzcf92z4138zb61bze20049651147openalex-snapshot
Width Parameters on Even-Hole-Free 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.