On the public citation graph

Minimal imperfect graphs: A simple approach

https://doi.org/10.1007/bf01844846
0 signed · 31 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01580235openalex-snapshot
Perfect zero–one matrices
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/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

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-387-22444-0_3openalex-snapshot
On the coloration of perfect graphs
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_21openalex-snapshot
On ideal clutters, metrics and multiflows
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_3openalex-snapshot
Bipartite Designs
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_4openalex-snapshot
Characterizing Noninteger Polyhedra with 0–1 Constraints
inferred← citeshttps://doi.org/10.1007/978-1-4613-0163-9_7openalex-snapshot
Kneser Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_9openalex-snapshot
Colorings
inferred← citeshttps://doi.org/10.1007/s00373-003-0540-1openalex-snapshot
Vertex Colouring and Forbidden Subgraphs ? A Survey
inferred← citeshttps://doi.org/10.1007/s00373-021-02410-wopenalex-snapshot
Point Partition Numbers: Perfect Graphs
inferred← citeshttps://doi.org/10.1007/s00493-003-0022-3openalex-snapshot
Imperfect and Nonideal Clutters: A Common Approach
inferred← citeshttps://doi.org/10.1007/s004930200001openalex-snapshot
Perfect Graphs, Partitionable Graphs and Cutsets
inferred← citeshttps://doi.org/10.1007/s11856-023-2506-8openalex-snapshot
Attempting perfect hypergraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.12.014openalex-snapshot
χ -boundedness and related problems on graphs without long induced paths: A survey
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/s0024-3795(01)00570-5openalex-snapshot
Non-regular square bipartite designs
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.010openalex-snapshot
Perfect graphs
inferred← citeshttps://doi.org/10.1017/s0963548323000044openalex-snapshot
Problems and results on 1-cross-intersecting set pair systems
inferred← citeshttps://doi.org/10.1137/1.9780898717105openalex-snapshot
Combinatorial Optimization
inferred← citeshttps://doi.org/10.1137/1.9780898719796.ch14openalex-snapshot
14. The Strong Perfect Graph Conjecture
inferred← citeshttps://doi.org/10.1137/22m1530410openalex-snapshot
A Sum of Squares Characterization of Perfect Graphs
inferred← citeshttps://doi.org/10.1186/s13660-026-03451-6openalex-snapshot
On the validity of Lovász’s inequality for induced star-perfect graphs
inferred← citeshttps://doi.org/10.1287/opre.2018.1763openalex-snapshot
Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1301.5149openalex-snapshot
Perfect graphs: a survey
inferred← citeshttps://doi.org/10.48550/arxiv.1309.0119openalex-snapshot
Graphes parfaits : structure et algorithmes
inferred← citeshttps://doi.org/10.48550/arxiv.math/0304464openalex-snapshot
The strong perfect graph conjecture
inferred← citeshttps://doi.org/10.5860/choice.39-4018openalex-snapshot
Combinatorial optimization: packing and covering
inferred← citeshttps://doi.org/10.7916/d89z9bzkopenalex-snapshot
Forbidden Substructures in Graphs and Trigraphs, and Related Coloring Problems
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.