On the public citation graph
Bull-free Berge graphs are perfect
0 signed · 106 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.1016/0012-365x(72)90006-4openalex-snapshot
Normal hypergraphs and the perfect graph conjecture
inferredcites →https://doi.org/10.1016/0095-8956(74)90063-xopenalex-snapshot
On a property of the class of n-colorable graphs
inferredcites →https://doi.org/10.1016/0095-8956(85)90049-8openalex-snapshot
Star-cutsets and perfect graphs
inferredcites →https://doi.org/10.1016/0095-8956(88)90071-8openalex-snapshot
No antitwins in minimal imperfect graphs
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.20334openalex-snapshot
Bounding χ in terms of ω and Δ for quasi‐line graphs
inferred← citeshttps://doi.org/10.1002/jgt.20387openalex-snapshot
Complexity of clique‐coloring odd‐hole‐free graphs
inferred← citeshttps://doi.org/10.1002/jgt.21679openalex-snapshot
Asymptotics of the Chromatic Number for Quasi‐Line Graphs
inferred← citeshttps://doi.org/10.1002/jgt.21688openalex-snapshot
The Structure of Bull-Free Perfect Graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190190212openalex-snapshot
On the two‐edge‐colorings of perfect graphs
inferred← citeshttps://doi.org/10.1006/jctb.1996.0042openalex-snapshot
On theP4-Structure of Perfect Graphs V. Overlap Graphs
inferred← citeshttps://doi.org/10.1006/jctb.1998.1872openalex-snapshot
A Description of Claw-Free Perfect Graphs
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-45477-2_29openalex-snapshot
Critical and Anticritical Edges in Perfect Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_11openalex-snapshot
Spectral Properties of Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_5openalex-snapshot
Independent Sets and Matchings
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_6openalex-snapshot
Eulerian and Hamiltonian Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-30559-0_10openalex-snapshot
Bimodular Decomposition of Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-89550-3_11openalex-snapshot
Fast Skew Partition Recognition
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_38openalex-snapshot
Algorithms for Some H-Join Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-7643-7400-6_14openalex-snapshot
Even Pairs in Bull-reducible Graphs
inferred← citeshttps://doi.org/10.1007/bf01202235openalex-snapshot
On the structure of bull-free perfect graphs
inferred← citeshttps://doi.org/10.1007/bf01929485openalex-snapshot
Recognizing bull-free perfect graphs
inferred← citeshttps://doi.org/10.1007/bf02988303openalex-snapshot
Most unbreakable murky graphs are bull-free
inferred← citeshttps://doi.org/10.1007/bf03353015openalex-snapshot
Chair-Free Berge Graphs Are Perfect
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-007-0721-4openalex-snapshot
Vašek Chvátal: A Very Short Introduction
inferred← citeshttps://doi.org/10.1007/s00373-014-1469-2openalex-snapshot
Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs
inferred← citeshttps://doi.org/10.1007/s00453-013-9820-1openalex-snapshot
Computing H-Joins with Application to 2-Modular Decomposition
inferred← citeshttps://doi.org/10.1007/s00453-018-0457-yopenalex-snapshot
Polynomial Cases for the Vertex Coloring Problem
inferred← citeshttps://doi.org/10.1007/s004930200001openalex-snapshot
Perfect Graphs, Partitionable Graphs and Cutsets
inferred← citeshttps://doi.org/10.1007/s10878-005-1775-yopenalex-snapshot
A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs
inferred← citeshttps://doi.org/10.1007/s10878-013-9651-7openalex-snapshot
Progress on the Murty–Simon Conjecture on diameter-2 critical graphs: a survey
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90539-6openalex-snapshot
A decomposition for a class of (P5,P5)-free graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00093-copenalex-snapshot
A new class of perfect Hoàng graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00156-qopenalex-snapshot
Some properties of minimal imperfect graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90143-lopenalex-snapshot
On the closure of triangle-free graphs under substitution
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90074-topenalex-snapshot
Hamiltonicity in claw-free graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90078-xopenalex-snapshot
Two classes of perfect graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90032-jopenalex-snapshot
Stability number of bull- and chair-free graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00090-eopenalex-snapshot
An algorithm for finding homogeneous pairs
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.05.054openalex-snapshot
Skew partitions in perfect graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.09.004openalex-snapshot
Graph parameters measuring neighbourhoods in graphs—Bounds and applications
inferred← citeshttps://doi.org/10.1016/j.dam.2009.03.017openalex-snapshot
Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.05.011openalex-snapshot
Transitive orientations in bull-reducible Berge graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.04.026openalex-snapshot
Finding a smallest odd hole in a claw-free graph using global structure
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.008openalex-snapshot
Algorithmic aspects of switch cographs
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.endm.2004.06.026openalex-snapshot
A representation for the modular-pairs of a cograph by modular decomposition
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.010openalex-snapshot
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.06.007openalex-snapshot
Claw-free graphs. IV. Decomposition theorem
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.07.004openalex-snapshot
Decomposing Berge graphs and detecting balanced skew partitions
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.06.002openalex-snapshot
Combinatorial optimization with 2-joins
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.07.003openalex-snapshot
The structure of bull-free graphs I—Three-edge-paths with centers and anticenters
inferred← citeshttps://doi.org/10.1016/j.jctb.2013.02.004openalex-snapshot
Substitution and χ -boundedness
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/j.jctb.2025.08.002openalex-snapshot
Reuniting χ-boundedness with polynomial χ-boundedness
inferred← citeshttps://doi.org/10.1016/j.orl.2011.04.002openalex-snapshot
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00174-4openalex-snapshot
Path parity and perfection
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00114-xopenalex-snapshot
A nice class for the vertex packing problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00134-6openalex-snapshot
On perfect switching classes
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00153-xopenalex-snapshot
On perfect switching classes
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00012-8openalex-snapshot
On minimal imperfect graphs without induced P5
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00112-xopenalex-snapshot
On Perfect Cayley Graphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00368-3openalex-snapshot
Bull-Reducible Berge Graphs are Perfect
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.1051/ita:2005009openalex-snapshot
The perfection and recognition of bull-reducible Berge graphs
inferred← citeshttps://doi.org/10.1109/ccc.2014.14openalex-snapshot
Counting List Matrix Partitions of Graphs
inferred← citeshttps://doi.org/10.1137/06065948xopenalex-snapshot
Coloring Bull-Free Perfectly Contractile Graphs
inferred← citeshttps://doi.org/10.1137/1.9780898719796.ch14openalex-snapshot
14. The Strong Perfect Graph Conjecture
inferred← citeshttps://doi.org/10.1137/140963029openalex-snapshot
Counting List Matrix Partitions of Graphs
inferred← citeshttps://doi.org/10.1137/s0895480100370797openalex-snapshot
On the Co- P 3 -Structure of Perfect Graphs
inferred← citeshttps://doi.org/10.1137/s0895480198339237openalex-snapshot
Optimizing Bull-Free 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.4007/annals.2006.164.51openalex-snapshot
The strong perfect graph theorem
inferred← citeshttps://doi.org/10.48550/arxiv.1103.2601openalex-snapshot
A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants)
inferred← citeshttps://doi.org/10.48550/arxiv.1103.6222openalex-snapshot
Finding a smallest odd hole in a claw-free graph using global structure
inferred← citeshttps://doi.org/10.48550/arxiv.1306.5176openalex-snapshot
Counting list matrix partitions of graphs
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
inferred← citeshttps://doi.org/10.82308/16876openalex-snapshot
Claw-free graphs and two conjectures on omega, Delta, and chi
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.