Line graphs of bounded clique-width (Q2461201): Difference between revisions

@@ Property / author @@
+Egon Wanke
@@ Property / author: Egon Wanke / 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.disc.2007.01.020
+Normal rank
@@ Property / OpenAlex ID @@
+W2015256259
@@ Property / OpenAlex ID: W2015256259 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q30051303
@@ Property / Wikidata QID: Q30051303 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+An algebraic theory of graph reduction
@@ Property / cites work: An algebraic theory of graph reduction / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of derived graphs
@@ Property / cites work: Characterizations of derived graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
+Normal rank
@@ Property / cites work @@
+Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
+Normal rank
@@ Property / cites work @@
+Q4414485
@@ Property / cites work: Q4414485 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4508369
@@ Property / cites work: Q4508369 / 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 @@
+On the Relationship Between Clique-Width and Treewidth
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+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 @@
+Handbook of Graph Grammars and Computing by Graph Transformation
+Normal rank
@@ Property / cites work @@
+Q4448752
@@ Property / cites work: Q4448752 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding Clique-Width for Graphs of Bounded Tree-Width
+Normal rank
@@ Property / cites work @@
+Clique-width minimization is NP-hard
@@ Property / cites work: Clique-width minimization is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
@@ Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank @@
+Normal rank
@@ Property / cites work @@
+Q2721972
@@ Property / cites work: Q2721972 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2766682
@@ Property / cites work: Q2766682 / rank @@
+Normal rank
@@ Property / cites work @@
+LATIN 2004: Theoretical Informatics
@@ Property / cites work: LATIN 2004: Theoretical Informatics / 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 @@
+Vertex disjoint paths on clique-width bounded graphs
+Normal rank
@@ Property / cites work @@
+Q4489221
@@ Property / cites work: Q4489221 / rank @@
+Normal rank
@@ Property / cites work @@
+<font>NLC</font><sub>2</sub>-DECOMPOSITION IN POLYNOMIAL TIME
+Normal rank
@@ Property / cites work @@
+Edge dominating set and colorings on graphs with fixed clique-width
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
+Normal rank
@@ Property / cites work @@
+Chordal bipartite graphs of bounded tree- and clique-width
+Normal rank
@@ Property / cites work @@
+The edge-disjoint paths problem is NP-complete for series-parallel graphs
+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 @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / 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 @@
+On simple characterizations of k-trees
@@ Property / cites work: On simple characterizations of k-trees / rank @@
+Normal rank
@@ Property / cites work @@
+A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
+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 @@
+\(k\)-NLC graphs and polynomial algorithms
@@ Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank @@
+Normal rank