Clique-width of path powers (Q266933): Difference between revisions

@@ 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.2015.11.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2286033726
@@ Property / OpenAlex ID: W2286033726 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+Handle-rewriting hypergraph grammars
@@ Property / cites work: Handle-rewriting hypergraph grammars / rank @@
+Normal rank
@@ Property / cites work @@
+A characterisation of clique-width through nested partitions
+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 @@
+Clique-Width is NP-Complete
@@ Property / cites work: Clique-Width is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / 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 @@
+Linear layouts measuring neighbourhoods in graphs
@@ Property / cites work: Linear layouts measuring neighbourhoods in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Complete Characterisation of the Linear Clique-Width of Path Powers
+Normal rank
@@ Property / cites work @@
+Graphs of linear clique-width at most 3
@@ Property / cites work: Graphs of linear clique-width at most 3 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width
+Normal rank
@@ Property / cites work @@
+Minimal classes of graphs of unbounded clique-width
+Normal rank
@@ Property / cites work @@
+The relative clique-width of a graph
@@ Property / cites work: The relative clique-width of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+On a disparity between relative cliquewidth and relative NLC-width
+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 @@
+Q5588432
@@ Property / cites work: Q5588432 / rank @@
+Normal rank