On the public citation graph
On the structure of bull-free perfect graphs
0 signed · 44 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/bf01787477openalex-snapshot
Optimizing weakly triangulated graphs
inferredcites →https://doi.org/10.1007/bf01788536openalex-snapshot
Bull-free Berge graphs are perfect
inferredcites →https://doi.org/10.1007/bf01788689openalex-snapshot
Optimizing weakly triangulated graphs
inferredcites →https://doi.org/10.1007/bf01929485openalex-snapshot
Recognizing bull-free perfect graphs
inferredcites →https://doi.org/10.1016/0012-365x(88)90047-7openalex-snapshot
Perfectly orderable graphs are quasi-parity graphs: a short proof
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)90050-4openalex-snapshot
Weakly triangulated graphs
inferredcites →https://doi.org/10.1016/0095-8956(90)90077-dopenalex-snapshot
Perfectly contractile graphs
inferredcites →https://doi.org/10.1016/0166-218x(92)90180-iopenalex-snapshot
P4-trees and substitution decomposition
inferredcites →https://doi.org/10.1016/s0195-6698(87)80037-9openalex-snapshot
A New Property of Critical Imperfect Graphs and some Consequences
inferredcites →https://doi.org/10.1016/s0304-0208(08)72445-9openalex-snapshot
Transformations which Preserve Perfectness and H-Perfectness of Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)72923-2openalex-snapshot
Perfectly Ordered Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)72943-8openalex-snapshot
Polynomial Algorithms for Perfect Graphs
inferredcites →https://doi.org/10.1137/0214065openalex-snapshot
A Linear Recognition Algorithm for Cographs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199912)32:4<359::aid-jgt5>3.0.co;2-uopenalex-snapshot
Perfectly contractile diamond-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/jctb.1998.1841openalex-snapshot
Even Pairs in 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/10719839_15openalex-snapshot
On Dart-Free Perfectly Contractile Graphs Extended Abstract
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/s00373-014-1461-xopenalex-snapshot
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull
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.2010.05.011openalex-snapshot
Transitive orientations in bull-reducible Berge graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.03.011openalex-snapshot
4-coloring (P6,bull) -free graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.04.059openalex-snapshot
Structure and coloring of ( P 7 , C 5 , diamond)-free graphs
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.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.tcs.2003.11.026openalex-snapshot
On dart-free perfectly contractile graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00174-4openalex-snapshot
Path parity and perfection
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00368-3openalex-snapshot
Bull-Reducible Berge Graphs are Perfect
inferred← citeshttps://doi.org/10.1051/ita:2005009openalex-snapshot
The perfection and recognition of bull-reducible Berge graphs
inferred← citeshttps://doi.org/10.1112/blms.12789openalex-snapshot
Perfectly contractile graphs and quadratic toric rings
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.48550/arxiv.1309.0119openalex-snapshot
Graphes parfaits : structure et algorithmes
inferred← citeshttps://doi.org/10.48550/arxiv.1511.08911openalex-snapshot
4-coloring ($P_6$, bull)-free graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1602.06817openalex-snapshot
The maximum weight stable set problem in $(P_6,\mbox{bull})$-free graphs
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.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.