On the public citation graph
Near-perfect matrices
0 signed · 53 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-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf01580121openalex-snapshot
On the facial structure of set packing polyhedra
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(72)90006-4openalex-snapshot
Normal hypergraphs and the perfect graph conjecture
inferredcites →https://doi.org/10.1016/0012-365x(79)90065-7openalex-snapshot
Graphical properties related to minimal imperfection
inferredcites →https://doi.org/10.1016/0012-365x(79)90114-6openalex-snapshot
Combinatorial designs related to the strong perfect graph conjecture
inferredcites →https://doi.org/10.1016/0024-3795(76)90079-3openalex-snapshot
Almost integral polyhedra related to certain combinatorial optimization problems
inferredcites →https://doi.org/10.1016/0095-8956(72)90045-7openalex-snapshot
A characterization of perfect graphs
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(76)90005-8openalex-snapshot
On the strong perfect graph conjecture
inferredcites →https://doi.org/10.1016/0095-8956(77)90064-8openalex-snapshot
Critical perfect graphs and perfect 3-chromatic graphs
inferredcites →https://doi.org/10.1016/0377-2217(89)90341-xopenalex-snapshot
Graph theory and applications
inferredcites →https://doi.org/10.1016/b978-0-12-358350-5.50006-3openalex-snapshot
On the Perfect Graph Theorem
inferredcites →https://doi.org/10.1016/s0304-0208(08)72443-5openalex-snapshot
Polyhedra for Composed Independence Systems
inferredcites →https://doi.org/10.1016/s0304-0208(08)72934-7openalex-snapshot
An Equivalent Version of the Strong Perfect Graph Conjecture
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1137/0602044openalex-snapshot
Integer Rounding for Polymatroid and Branching Optimization Problems
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(200004)33:4<256::aid-jgt7>3.0.co;2-2openalex-snapshot
The round-up property of the fractional chromatic number for proper circular arc graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-09174-7_19openalex-snapshot
Lovász and Schrijver $$N_+$$ -Relaxation on Web Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-45587-7_6openalex-snapshot
Lovász-Schrijver PSD-Operator on Claw-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-29210-1_8openalex-snapshot
The stable set polytope of claw-free graphs with stability number greater than three
inferred← citeshttps://doi.org/10.1007/bf01590960openalex-snapshot
Applying Lehman's theorems to packing problems
inferred← citeshttps://doi.org/10.1007/s10107-016-1035-1openalex-snapshot
Lovász–Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2005.05.042openalex-snapshot
On non-rank facets of stable set polytopes of webs with clique number four
inferred← citeshttps://doi.org/10.1016/j.dam.2006.03.027openalex-snapshot
On a certain class of nonideal clutters
inferred← citeshttps://doi.org/10.1016/j.dam.2009.05.003openalex-snapshot
On packing and covering polyhedra of consecutive ones circulant clutters
inferred← citeshttps://doi.org/10.1016/j.dam.2013.02.022openalex-snapshot
2 -clique-bond of stable set polyhedra
inferred← citeshttps://doi.org/10.1016/j.dam.2013.03.028openalex-snapshot
Some advances on Lovász–Schrijver semidefinite programming relaxations of the fractional stable set polytope
inferred← citeshttps://doi.org/10.1016/j.dam.2018.11.021openalex-snapshot
On total f -domination: Polyhedral and algorithmic results
inferred← citeshttps://doi.org/10.1016/j.dam.2023.01.012openalex-snapshot
Lovász–Schrijver PSD-operator and the stable set polytope of claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.03.031openalex-snapshot
On facets of stable set polytopes of claw-free graphs with stability number 3
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.disc.2015.09.028openalex-snapshot
The stable set polytope of icosahedral graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2008.11.001openalex-snapshot
On the set covering polyhedron of circulant matrices
inferred← citeshttps://doi.org/10.1016/j.endm.2004.06.004openalex-snapshot
On a certain class of nonideal clutters
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.082openalex-snapshot
Generalized clique family inequalities for claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2011.05.067openalex-snapshot
Near-perfect graphs with polyhedral
inferred← citeshttps://doi.org/10.1016/j.endm.2013.10.053openalex-snapshot
Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2014.02.006openalex-snapshot
The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W -perfect
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80043-5openalex-snapshot
Polyhedral Sets and Integer Rounding
inferred← citeshttps://doi.org/10.1051/ro:2008030openalex-snapshot
Comparing Imperfection Ratio and Imperfection Index for Graph Classes
inferred← citeshttps://doi.org/10.1111/itor.12275openalex-snapshot
Characterizing ‐perfect line graphs
inferred← citeshttps://doi.org/10.1137/1.9780898718805.ch7openalex-snapshot
7. Relaxing Perfectness: Which Graphs Are “Almost” Perfect?
inferred← citeshttps://doi.org/10.1137/s089548019630978xopenalex-snapshot
Bounded Stable Sets: Polytopes and Colorings
inferred← citeshttps://doi.org/10.1287/moor.1090.0407openalex-snapshot
Gear Composition of Stable Set Polytopes and 𝒢-Perfection
inferred← citeshttps://doi.org/10.1287/moor.26.1.1.10597openalex-snapshot
Almost Perfect Matrices and Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1604.02288openalex-snapshot
On 4-critical t-perfect 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.