Classifying the clique-width of \(H\)-free bipartite graphs (Q906431): Difference between revisions

@@ Property / OpenAlex ID @@
+W1581957840
@@ Property / OpenAlex ID: W1581957840 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.7060
@@ Property / arXiv ID: 1402.7060 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4425939
@@ Property / cites work: Q4425939 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounding the Clique-Width of H-free Chordal Graphs
+Normal rank
@@ Property / cites work @@
+Bounding the clique-width of \(H\)-free split graphs
+Normal rank
@@ Property / cites work @@
+Clique-width for 4-vertex forbidden subgraphs
@@ Property / cites work: Clique-width for 4-vertex forbidden subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5387674
@@ Property / cites work: Q5387674 / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of (\(P_{5}\),\,gem)-free graphs
@@ Property / cites work: On the structure of (\(P_{5}\),\,gem)-free graphs / 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 @@
+Q5463359
@@ Property / cites work: Q5463359 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
+Normal rank
@@ Property / cites work @@
+On variations of \(P_{4}\)-sparse graphs
@@ Property / cites work: On variations of \(P_{4}\)-sparse graphs / rank @@
+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 @@
+Colouring of graphs with Ramsey-type forbidden subgraphs
+Normal rank
@@ Property / cites work @@
+Bounding Clique-Width via Perfect Graphs
@@ Property / cites work: Bounding Clique-Width via Perfect Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Classifying the Clique-Width of H-Free Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs
+Normal rank
@@ Property / cites work @@
+Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
+Normal rank
@@ Property / cites work @@
+Recent developments on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Edge dominating set and colorings on graphs with fixed clique-width
+Normal rank
@@ Property / cites work @@
+On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
+Normal rank
@@ Property / cites work @@
+Q5487903
@@ Property / cites work: Q5487903 / rank @@
+Normal rank
@@ Property / cites work @@
+THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S
+Normal rank
@@ Property / cites work @@
+Approximating rank-width and clique-width quickly
@@ Property / cites work: Approximating rank-width and clique-width quickly / rank @@
+Normal rank
@@ Property / cites work @@
+MSOL partitioning problems on graphs of bounded treewidth and clique-width
+Normal rank