On the public citation graph
Recognizing bull-free perfect graphs
0 signed · 47 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/bf01788536openalex-snapshot
Bull-free Berge graphs are perfect
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/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(85)90050-4openalex-snapshot
Weakly triangulated graphs
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)72938-4openalex-snapshot
Polynomial Algorithm to Recognize a Meyniel Graph
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7148-8openalex-snapshot
Topics on Perfect 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.20387openalex-snapshot
Complexity of clique‐coloring odd‐hole‐free graphs
inferred← citeshttps://doi.org/10.1002/jgt.21688openalex-snapshot
The Structure of Bull-Free Perfect Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22367openalex-snapshot
Perfect divisibility and 2‐divisibility
inferred← citeshttps://doi.org/10.1006/jcta.1997.2769openalex-snapshot
A Robinson–Schensted Algorithm for a Class of Partial Orders
inferred← citeshttps://doi.org/10.1007/978-3-319-42634-1_31openalex-snapshot
Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-64419-6_37openalex-snapshot
On Graphs Whose Graphoidal Length Is Half of Its Size
inferred← citeshttps://doi.org/10.1007/978-3-662-53536-3_8openalex-snapshot
The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs
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/s00373-012-1133-7openalex-snapshot
On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs
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-018-0457-yopenalex-snapshot
Polynomial Cases for the Vertex Coloring Problem
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.2015.02.012openalex-snapshot
Maximum weight independent sets in classes related to claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.10.005openalex-snapshot
Some properties of edge intersection graphs of single-bend paths on a grid
inferred← citeshttps://doi.org/10.1016/j.disc.2017.10.004openalex-snapshot
Maximum weight stable set in ( P 7 , bull)-free graphs and ( S 1 , 2 , 3 , bull)-free graphs
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.2011.07.003openalex-snapshot
The structure of bull-free graphs I—Three-edge-paths with centers and anticenters
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00174-4openalex-snapshot
Path parity and perfection
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00076-3openalex-snapshot
The homogeneous set sandwich problem
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00368-3openalex-snapshot
Bull-Reducible Berge Graphs are Perfect
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/sfcs.2003.1238177openalex-snapshot
A polynomial algorithm for recognizing perfect graphs
inferred← citeshttps://doi.org/10.1137/06065948xopenalex-snapshot
Coloring Bull-Free Perfectly Contractile Graphs
inferred← citeshttps://doi.org/10.1137/s0895480198339237openalex-snapshot
Optimizing Bull-Free Perfect Graphs
inferred← citeshttps://doi.org/10.2478/s11533-014-0449-3openalex-snapshot
A maximum degree theorem for diameter-2-critical graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1309.0119openalex-snapshot
Graphes parfaits : structure et algorithmes
inferred← citeshttps://doi.org/10.48550/arxiv.1611.09663openalex-snapshot
Maximum Weight Stable Set in ($P_7$, bull)-free graphs and ($S_{1,2,3}$, bull)-free graphs
inferred← citeshttps://doi.org/10.5555/2095116.2095217openalex-snapshot
A faster algorithm to recognize even-hole-free graphs
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.