A local characterization of bounded clique-width for line graphs (Q868337): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2006.07.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2006089834
@@ Property / OpenAlex ID: W2006089834 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414485
@@ Property / cites work: Q4414485 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of Computation Theory
@@ Property / cites work: Fundamentals of Computation Theory / rank @@
+Normal rank
@@ Property / cites work @@
+GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
+Normal rank
@@ Property / cites work @@
+Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Monadic second-order evaluations on tree-decomposable graphs
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+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 @@
+On the relationship between NLC-width and linear NLC-width
+Normal rank
@@ Property / cites work @@
+Q4489221
@@ Property / cites work: Q4489221 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+\(k\)-NLC graphs and polynomial algorithms
@@ Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank @@
+Normal rank