A note on the computational complexity of graph vertex partition (Q868398): Difference between revisions

@@ Property / author @@
-Yuan Qiu Huang
@@ Property / author: Yuan Qiu Huang / rank @@
-Normal rank
@@ Property / author @@
+Yuan Qiu Huang
@@ Property / author: Yuan Qiu Huang / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2006.06.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2058728300
@@ Property / OpenAlex ID: W2058728300 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ 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 @@
+Clique and anticlique partitions of graphs
@@ Property / cites work: Clique and anticlique partitions of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Ear Decompositions and Graph Embeddings
@@ Property / cites work: Graph Ear Decompositions and Graph Embeddings / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases
+Normal rank
@@ Property / cites work @@
+How to determine the maximum genus of a graph
@@ Property / cites work: How to determine the maximum genus of a graph / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:868398