Premium
The Structure of Bull‐Free Perfect Graphs
Author(s) -
Chudnovsky Maria,
Penev Irena
Publication year - 2013
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.21688
Subject(s) - combinatorics , mathematics , perfect graph theorem , cograph , distance hereditary graph , induced subgraph , perfect graph , split graph , disjoint sets , graph factorization , graph , vertex (graph theory) , discrete mathematics , chromatic scale , line graph , pathwidth , graph power
The bull is a graph consisting of a triangle and two vertex‐disjoint pendant edges. A graph is called bull‐free if no induced subgraph of it is a bull. A graph G is perfect if for every induced subgraph H of G , the chromatic number of H equals the size of the largest complete subgraph of H . This article describes the structure of all bull‐free perfect graphs.