Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808): Difference between revisions

← Older edit

@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 2136944
@@ Property / DOI @@
-.1016/j.dam.2004.01.014
@@ Property / DOI: 10.1016/j.dam.2004.01.014 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2004.01.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2040593601
@@ Property / OpenAlex ID: W2040593601 / rank @@
+Normal rank
@@ Property / cites work @@
+Distance-hereditary graphs
@@ Property / cites work: Distance-hereditary graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Pathwidth and Treewidth of Cographs
@@ Property / cites work: The Pathwidth and Treewidth of Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q4508369
@@ Property / cites work: Q4508369 / rank @@
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3676177
@@ Property / cites work: Q3676177 / 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 @@
+Q4448749
@@ Property / cites work: Q4448749 / rank @@
+Normal rank
@@ Property / cites work @@
+Handle-rewriting hypergraph grammars
@@ Property / cites work: Handle-rewriting hypergraph grammars / 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 @@
+Q4954442
@@ Property / cites work: Q4954442 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient and practical algorithms for sequential modular decomposition
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / 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 @@
+Completely separable graphs
@@ Property / cites work: Completely separable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of ptolemaic graphs
@@ Property / cites work: A characterization of ptolemaic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S
+Normal rank
@@ Property / cites work @@
+Modular decomposition and transitive orientation
@@ Property / cites work: Modular decomposition and transitive orientation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3683903
@@ Property / cites work: Q3683903 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+The Complexity of the Partial Order Dimension Problem
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2004.01.014
@@ Property / DOI: 10.1016/J.DAM.2004.01.014 / rank @@
+Normal rank
@@ Property / Recommended article @@
+GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
+Normal rank
+Similarity Score: 0.9280738Amount 0.9280738
Unit 1
-Amount
+.9280738
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS
+Normal rank
+Similarity Score: 0.8927191Amount 0.8927191
Unit 1
-Amount
+.8927191
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Bounding the Clique-Width of H-free Chordal Graphs
+Normal rank
+Similarity Score: 0.88312846Amount 0.88312846
Unit 1
-Amount
+.88312846
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs
+Normal rank
+Similarity Score: 0.88312835Amount 0.88312835
Unit 1
-Amount
+.88312835
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+On the structure of (\(P_{5}\),\,gem)-free graphs
+Normal rank
+Similarity Score: 0.8750223Amount 0.8750223
Unit 1
-Amount
+.8750223
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs
+Normal rank
+Similarity Score: 0.86187065Amount 0.86187065
Unit 1
-Amount
+.86187065
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Chordal bipartite graphs of bounded tree- and clique-width
+Normal rank
+Similarity Score: 0.8599687Amount 0.8599687
Unit 1
-Amount
+.8599687
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+On algorithms for (\(P_5\), gem)-free graphs
+Normal rank
+Similarity Score: 0.85944664Amount 0.85944664
Unit 1
-Amount
+.85944664
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs
+Normal rank
+Similarity Score: 0.8539583Amount 0.8539583
Unit 1
-Amount
+.8539583
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Q5000997
@@ Property / Recommended article: Q5000997 / rank @@
+Normal rank
@@ Property / Recommended article: Q5000997 / qualifier @@
+Similarity Score: 0.84818906Amount 0.84818906
Unit 1
-Amount
+.84818906
 Unit
@@ Property / Recommended article: Q5000997 / qualifier @@
+Recommender Run: Recommender Run 3