On the public citation graph

Line perfect graphs

https://doi.org/10.1007/bf01593791
0 signed · 71 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/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/bf01584085openalex-snapshot
Blocking and anti-blocking pairs of polyhedra
inferredcites →https://doi.org/10.1007/bf01792729openalex-snapshot
Theorie der endlichen und unendlichen Graphen
inferredcites →https://doi.org/10.1007/bfb0066196openalex-snapshot
Facets of I-matching polyhedra
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/0095-8956(72)90002-0openalex-snapshot
Establishing the matching polytope
inferredcites →https://doi.org/10.1016/0095-8956(72)90032-9openalex-snapshot
Anti-blocking polyhedra
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/0097-3165(72)90002-7openalex-snapshot
Simple constructions for balanced incomplete block designs with block size three
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/s0095-8956(76)80005-6openalex-snapshot
The strong perfect-graph conjecture is true for K1,3-free graphs
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.4153/cjm-1965-045-4openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118032497.ch8openalex-snapshot
Perfect Graphs
inferred← citeshttps://doi.org/10.1002/jgt.21686openalex-snapshot
Identifying Codes in Line Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22611openalex-snapshot
Minimum weighted clique cover on claw‐free perfect graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190050306openalex-snapshot
On the existence of generalized good and equitable edge colorings
inferred← citeshttps://doi.org/10.1002/jgt.3190170108openalex-snapshot
Perfect k‐line graphs and k‐total graphs
inferred← citeshttps://doi.org/10.1006/jctb.2001.2042openalex-snapshot
Graph Imperfection
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_41openalex-snapshot
Dominoes
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_6openalex-snapshot
Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-69546-9_59openalex-snapshot
Some Min-Max Formulations for Partitioning Problems in Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_26openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/bf01589347openalex-snapshot
A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
inferred← citeshttps://doi.org/10.1007/bf01609025openalex-snapshot
On line perfect graphs
inferred← citeshttps://doi.org/10.1007/bf01858447openalex-snapshot
Open shop scheduling with some additional constraints
inferred← citeshttps://doi.org/10.1007/bf02248592openalex-snapshot
Almost nonpreemptive schedules
inferred← citeshttps://doi.org/10.1007/bf02986685openalex-snapshot
Neighbourhood-Perfect Line Graphs
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.1007/s00373-023-02719-8openalex-snapshot
Toric Rings of Perfectly Matchable Subgraph Polytopes
inferred← citeshttps://doi.org/10.1007/s00373-025-02923-8openalex-snapshot
Matching Polytopes, Gorensteinness, and the Integer Decomposition Property
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90065-7openalex-snapshot
Graphical properties related to minimal imperfection
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90382-ropenalex-snapshot
Packing paths perfectly
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90374-3openalex-snapshot
Characterization of completely positive graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00350-ropenalex-snapshot
On edge perfectness and classes of bipartite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00109-aopenalex-snapshot
Gallai graphs and anti-Gallai graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(85)90088-7openalex-snapshot
The edge intersection graphs of paths in a tree
inferred← citeshttps://doi.org/10.1016/0095-8956(86)90042-0openalex-snapshot
Intersection graphs of paths in a tree
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90028-vopenalex-snapshot
Kernels in perfect line-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.05.048openalex-snapshot
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free 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.dam.2013.04.001openalex-snapshot
On minimal forbidden subgraph characterizations of balanced graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.05.021openalex-snapshot
Classes of perfect graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.01.036openalex-snapshot
A note on chromatic properties of threshold graphs
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/j.endm.2009.11.008openalex-snapshot
On minimal forbidden subgraph characterizations of balanced graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.056openalex-snapshot
Edge identifying codes
inferred← citeshttps://doi.org/10.1016/j.laa.2024.04.029openalex-snapshot
The graphs of pyramids are determined by their spectrum
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.037openalex-snapshot
(p,k) -coloring problems in line graphs
inferred← citeshttps://doi.org/10.1016/s0024-3795(03)00419-1openalex-snapshot
On completely positive graphs and their complements
inferred← citeshttps://doi.org/10.1016/s0024-3795(03)00611-6openalex-snapshot
Completely positive matrices
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00081-4openalex-snapshot
Polyhedral characterizations and perfection of line 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/s0304-0208(08)72933-5openalex-snapshot
Graphical Properties Related to Minimal Imperfection
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00296-8openalex-snapshot
An efficient tabu search approach for the 0–1 multidimensional knapsack problem
inferred← citeshttps://doi.org/10.1109/tnet.2019.2959797openalex-snapshot
Performance Guarantees of Distributed Algorithms for QoS in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/wispnet48689.2020.9198485openalex-snapshot
Distributed Algorithms for QoS in Wireless Ad Hoc Networks Under the Primary Interference Model
inferred← citeshttps://doi.org/10.1112/mtk.70099openalex-snapshot
Toric ideals of matching polytopes and edge colorings
inferred← citeshttps://doi.org/10.1137/20m1347747openalex-snapshot
Counting Weighted Independent Sets beyond the Permanent
inferred← citeshttps://doi.org/10.1137/s0097539703426799openalex-snapshot
Perfectness is an Elusive Graph Property
inferred← citeshttps://doi.org/10.48550/arxiv.1407.0626openalex-snapshot
A list analog of Vizing's Theorem for simple graphs with triangles but no other odd cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1509.05586openalex-snapshot
Ear-decompositions and the complexity of the matching polytope
inferred← citeshttps://doi.org/10.48550/arxiv.1601.01768openalex-snapshot
Complexity of choosability with a small palette of colors
inferred← citeshttps://doi.org/10.7151/dmgt.1115openalex-snapshot
Some conjectures on 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.