Partitioning extended \(P_4\)-laden graphs into cliques and stable sets
type: Item
instance of: scholarly article
title: Partitioning extended \(P_4\)-laden graphs into cliques and stable sets
zbMATH Open document ID: 1248.05153
author: Raquel S. F. Bravo
author: Sulamita Klein
author: Fábio Protti
author: Loana T. Nogueira
author: Rudini M. Sampaio
published in: Information Processing Letters
publication date: 2012-10-23T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6098095
zbMATH Keywords: graph algorithms
zbMATH Keywords: graph partition
zbMATH Keywords: \((k
zbMATH Keywords: \ell )\)-graphs
zbMATH Keywords: \(P_{4}\)-laden graphs
zbMATH Keywords: \ell )\)-cocoloring
zbMATH Keywords: cliques
MaRDI profile type: MaRDI publication profile
full work available at URL: j.ipl.2012.07.011
OpenAlex ID: W2088316879
cites work: The complexity of some problems related to GRAPH 3-COLORABILITY
cites work: Characterizing –partitionable Cographs
cites work: Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques
cites work: Partitioning cographs into cliques and stable sets
cites work: On split-coloring problems
cites work: Q3139768
cites work: Some extremal results in cochromatic and dichromatic theory
cites work: Chromatic number versus chromatic number in graphs with bounded clique number
cites work: Q3424776
cites work: Matrix partitions of perfect graphs
cites work: \(P_{4}\)-laden graphs: A new class of brittle graphs
cites work: Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
cites work: Partitioning chordal graphs into independent sets and cliques
cites work: Q4175304
cites work: On the \(b\)-coloring of \(P_{4}\)-tidy graphs
cites work: Q3681937
DOI: 10.1016/J.IPL.2012.07.011
description: scientific article; zbMATH DE number 6098095