Characterizing –partitionable Cographs
References (6)
- et al.
Partitioning chordal graphs into independent sets and cliques
Discrete Applied Mathematics
(2004) - et al.
Some simplified NP-complete graph problems
Theoretical Computer Science
(1976) Partitions of graphs into one or two independent sets and cliques
Discrete Mathematics
(1996)
There are more references available in the full text version of this article.
Cited by (11)
Characterizations, probe and sandwich problems on (k,ℓ)-cographs
2020, Discrete Applied MathematicsStructural characterization and decomposition for cographs-(2, 1) and (1, 2): A natural generalization of threshold graphs
2015, Electronic Notes in Discrete MathematicsPartitioning a graph into disjoint cliques and a triangle-free graph
2015, Discrete Applied MathematicsFixed-parameter algorithms for the cocoloring problem
2014, Discrete Applied MathematicsPartitioning extended P <inf>4</inf>-laden graphs into cliques and stable sets
2012, Information Processing LettersPartitioning Cographs into Two Forests and One Independent Set
2020, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- 1
Partially supported by CAPES, Brazil
- 2
Partially supported by CNPq, Brazil.
- 3
Partially supported by FAPERJ, Brazil.
Copyright © 2005 Elsevier B.V. All rights reserved.