On the public citation graph

On line perfect graphs

https://doi.org/10.1007/bf01609025
0 signed · 17 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/bf01593791openalex-snapshot
Line perfect graphs
inferredcites →https://doi.org/10.1016/0012-365x(72)90006-4openalex-snapshot
Normal hypergraphs and the perfect graph conjecture

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.3190170108openalex-snapshot
Perfect k‐line graphs and k‐total graphs
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_26openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/bf02248592openalex-snapshot
Almost nonpreemptive schedules
inferred← citeshttps://doi.org/10.1007/s00186-008-0257-2openalex-snapshot
Partial characterizations of coordinated graphs: line graphs and complements of forests
inferred← citeshttps://doi.org/10.1007/s00373-006-0686-8openalex-snapshot
Bicolored Matchings in Some Classes of Graphs
inferred← citeshttps://doi.org/10.1016/b978-0-12-289260-8.50010-8openalex-snapshot
Perfect Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.08.017openalex-snapshot
Mutual exclusion scheduling with interval graphs or related classes. Part II
inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.016openalex-snapshot
Mutual exclusion scheduling with interval graphs or related classes, Part I
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.033openalex-snapshot
Bicolored matchings in some classes of graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(04)80051-7openalex-snapshot
Perfect graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72931-1openalex-snapshot
The Strong Perfect Graph Theorem for a Class of Partitionable Graphs
inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70105-3openalex-snapshot
WITHDRAWN: References
inferred← citeshttps://doi.org/10.1137/0404046openalex-snapshot
Compact Cylindrical Chromatic Scheduling
inferred← citeshttps://doi.org/10.1137/s0097539703426799openalex-snapshot
Perfectness is an Elusive Graph Property
inferred← citeshttps://doi.org/10.7155/jgaa.00129openalex-snapshot
On the approximation of Min Split-coloring and Min Cocoloring
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.