Characterization and recognition of P₄-sparse graphs partitionable into k independent sets and cliques

Recommendations

Partitioning extended $P_4$-laden graphs into cliques and stable sets
On variations of $P_{4}$-sparse graphs
Partitioning sparse graphs into an independent set and a graph with bounded size components
Recognizing $P_4 $-Sparse Graphs in Linear Time
On semi-$P_ 4$-sparse graphs
On the recognition of $P_4$-indifferent graphs
Independent sets in $\{\text{claw}, K_4 \}$-free 4-regular graphs
Minimal separators in $P_4$-sparse graphs
On extended P₄-reducible and extended P₄-sparse graphs
A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs

Cites work

scientific article; zbMATH DE number 1262783 (Why is no real title available?)
P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
A Linear Recognition Algorithm for Cographs
A simple linear time LexBFS cograph recognition algorithm.
A tree representation for $P_ 4$-sparse graphs
Complement reducible graphs
Complexity of graph partition problems
Generalized colouring (matrix partitions) of cographs
Linear time optimization algorithms for $P_ 4$-sparse graphs
List Partitions
Matrix partitions of perfect graphs
Modular decomposition and transitive orientation
Partitioning chordal graphs into independent sets and cliques
Partitioning cographs into cliques and stable sets
Partitions of graphs into one or two independent sets and cliques
Recognizing $P_4 $-Sparse Graphs in Linear Time
The complexity of some problems related to GRAPH 3-COLORABILITY

Cited in

(8)

Characterizing –partitionable Cographs
On variations of $P_{4}$-sparse graphs
Fixed-parameter algorithms for the cocoloring problem
Edge clique partition in $(k,\ell)$-graphs
Partitioning a graph into disjoint cliques and a triangle-free graph
Partitioning extended $P_4$-laden graphs into cliques and stable sets
Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs
The $(k, \ell)$ partitioned probe problem: NP-complete versus polynomial dichotomy

This page was built for publication: Characterization and recognition of $P_{4}$-sparse graphs partitionable into $k$ independent sets and $\ell $ cliques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q629355)