Back to Search
Start Over
Characterizations of (4K1, C4, C5)-free graphs
- Source :
- Discrete Applied Mathematics. 231:166-174
- Publication Year :
- 2017
- Publisher :
- Elsevier BV, 2017.
-
Abstract
- Given a set L of graphs, a graph G is L -free if G does not contain any graph in L as an induced subgraph. There has been keen interest in colouring graphs whose forbidden list L contains graphs with four vertices. A recent paper of Lozin and Malyshev (in press) discusses the state of the art on this problem, identifying three outstanding classes: L = ( 4 K 1 , claw ) , L = ( 4 K 1 , claw, co-diamond ) , and L = ( 4 K 1 , C 4 ) . In this paper we investigate the class of ( 4 K 1 , C 4 , C 5 )-free graphs and show that if G is a ( 4 K 1 , C 4 , C 5 )-free graph, then G either has bounded clique width or is perfect.
- Subjects :
- Block graph
Discrete mathematics
Clique-sum
Applied Mathematics
0102 computer and information sciences
02 engineering and technology
16. Peace & justice
01 natural sciences
Combinatorics
Indifference graph
020303 mechanical engineering & transports
0203 mechanical engineering
010201 computation theory & mathematics
Chordal graph
Partial k-tree
Discrete Mathematics and Combinatorics
Cograph
Split graph
Forbidden graph characterization
Mathematics
Subjects
Details
- ISSN :
- 0166218X
- Volume :
- 231
- Database :
- OpenAIRE
- Journal :
- Discrete Applied Mathematics
- Accession number :
- edsair.doi...........dcac7ad400942c0922739411ab951bec