Characterization and recognition of $P_{4}$-sparse graphs partitionable into $k$ independent sets and $\ell $ cliques (Q629355): Difference between revisions

@@ Property / cites work @@
+Partitions of graphs into one or two independent sets and cliques
+Normal rank
@@ Property / cites work @@
+The complexity of some problems related to GRAPH 3-COLORABILITY
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4232773
@@ Property / cites work: Q4232773 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning cographs into cliques and stable sets
+Normal rank
@@ Property / cites work @@
+Matrix partitions of perfect graphs
@@ Property / cites work: Matrix partitions of perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3424776
@@ Property / cites work: Q3424776 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of graph partition problems
@@ Property / cites work: Complexity of graph partition problems / rank @@
+Normal rank
@@ Property / cites work @@
+List Partitions
@@ Property / cites work: List Partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning chordal graphs into independent sets and cliques
+Normal rank
@@ Property / cites work @@
+<i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
+Normal rank
@@ Property / cites work @@
+A tree representation for \(P_ 4\)-sparse graphs
@@ Property / cites work: A tree representation for \(P_ 4\)-sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing $P_4 $-Sparse Graphs in Linear Time
@@ Property / cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time optimization algorithms for \(P_ 4\)-sparse graphs
+Normal rank
@@ Property / cites work @@
+Modular decomposition and transitive orientation
@@ Property / cites work: Modular decomposition and transitive orientation / rank @@
+Normal rank

Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355): Difference between revisions

Latest revision as of 21:00, 3 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)