Treewidth versus clique number. II: Tree-independence number (Q6144406): Difference between revisions

@@ Property / DOI @@
-.1016/j.jctb.2023.10.006
@@ Property / DOI: 10.1016/j.jctb.2023.10.006 / rank @@
-Normal rank
@@ Property / cites work @@
+Q6147372
@@ Property / cites work: Q6147372 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Graph classes with structured neighborhoods and algorithmic applications
+Normal rank
@@ Property / cites work @@
+The \(k\)-separator problem: polyhedra, complexity and approximation results
+Normal rank
@@ Property / cites work @@
+Precoloring extension. I: Interval graphs
@@ Property / cites work: Precoloring extension. I: Interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4288578
@@ Property / cites work: Q4288578 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250226
@@ Property / cites work: Q4250226 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Treewidth computations. II. Lower bounds
@@ Property / cites work: Treewidth computations. II. Lower bounds / 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 @@
+Twin-width II: small classes
@@ Property / cites work: Twin-width II: small classes / rank @@
+Normal rank
@@ Property / cites work @@
+Twin-width I: Tractable FO Model Checking
@@ Property / cites work: Twin-width I: Tractable FO Model Checking / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Bounding the mim‐width of hereditary graph classes
+Normal rank
@@ Property / cites work @@
+Boolean-width of graphs
@@ Property / cites work: Boolean-width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
+Normal rank
@@ Property / cites work @@
+A characterisation of rigid circuit graphs
@@ Property / cites work: A characterisation of rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings
@@ Property / cites work: Induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Independent packings in structured graphs
@@ Property / cites work: Independent packings in structured graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring and Maximum Weight Independent Set of Rectangles
+Normal rank
@@ Property / cites work @@
+The weighted independent domination problem is NP-complete for chordal graphs
+Normal rank
@@ Property / cites work @@
+Kernelization of Graph Hamiltonicity: Proper $H$-Graphs
+Normal rank
@@ Property / cites work @@
+On \(H\)-topological intersection graphs
@@ Property / cites work: On \(H\)-topological intersection graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On \(H\)-topological intersection graphs
@@ Property / cites work: On \(H\)-topological intersection graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial problems on \(H\)-graphs
@@ Property / cites work: Combinatorial problems on \(H\)-graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Substitution and \(\chi\)-boundedness
@@ Property / cites work: Substitution and \(\chi\)-boundedness / rank @@
+Normal rank
@@ Property / cites work @@
+On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five
+Normal rank
@@ Property / cites work @@
+Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in <i>H</i>-free graphs
+Normal rank
@@ Property / cites work @@
+Clustering and domination in perfect graphs
@@ Property / cites work: Clustering and domination in perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Relationship Between Clique-Width and Treewidth
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+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 @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-width for hereditary graph classes
@@ Property / cites work: Clique-width for hereditary graph classes / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth versus clique number in graph classes with a forbidden structure
+Normal rank
@@ Property / cites work @@
+Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
+Normal rank
@@ Property / cites work @@
+Connected tree-width
@@ Property / cites work: Connected tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-decompositions with bags of small diameter
@@ Property / cites work: Tree-decompositions with bags of small diameter / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
+Normal rank
@@ Property / cites work @@
+Q3222876
@@ Property / cites work: Q3222876 / rank @@
+Normal rank
@@ Property / cites work @@
+Independent domination in chordal graphs
@@ Property / cites work: Independent domination in chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Minimum Weight Vertex Separators
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms and kernelization on almost chordal graphs
+Normal rank
@@ Property / cites work @@
+On the tractability of optimization problems on \(H\)-graphs
+Normal rank
@@ Property / cites work @@
+Fast FPT-approximation of branchwidth
@@ Property / cites work: Fast FPT-approximation of branchwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Large Induced Subgraphs via Triangulations and CMSO
+Normal rank
@@ Property / cites work @@
+The Complexity of Coloring Circular Arcs and Chords
+Normal rank
@@ Property / cites work @@
+Finding large induced sparse subgraphs in             <i>               c               <sub>&gt;t</sub>             </i>             -free graphs in quasipolynomial time
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+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 @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Polynomial-time Algorithm for Maximum Weight Independent Set on             <i>P</i>             <sub>6</sub>             -free Graphs
+Normal rank
@@ Property / cites work @@
+Q5749319
@@ Property / cites work: Q5749319 / rank @@
+Normal rank
@@ Property / cites work @@
+Structural parameterizations with modulator oblivion
+Normal rank
@@ Property / cites work @@
+Mim-width. III. Graph powers and generalized distance domination problems
+Normal rank
@@ Property / cites work @@
+A width parameter useful for chordal and co-comparability graphs
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Edge dominating set and colorings on graphs with fixed clique-width
+Normal rank
@@ Property / cites work @@
+Partitioning a graph into small pieces with applications to path transversal
+Normal rank
@@ Property / cites work @@
+Lower bounds on the mim-width of some graph classes
+Normal rank
@@ Property / cites work @@
+The complexity of dissociation set problems in graphs
+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 @@
+Maximum weight induced matching in some subclasses of bipartite graphs
+Normal rank
@@ Property / cites work @@
+Robust algorithms for restricted domains
@@ Property / cites work: Robust algorithms for restricted domains / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Q3358765
@@ Property / cites work: Q3358765 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of χ‐boundedness
@@ Property / cites work: A survey of χ‐boundedness / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-chromatic number
@@ Property / cites work: Tree-chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Q4944975
@@ Property / cites work: Q4944975 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient graph representations
@@ Property / cites work: Efficient graph representations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4551369
@@ Property / cites work: Q4551369 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition by clique separators
@@ Property / cites work: Decomposition by clique separators / rank @@
+Normal rank
@@ Property / cites work @@
+Representations of chordal graphs as subtrees of a tree
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607892
@@ Property / cites work: Q4607892 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate association via dissociation
@@ Property / cites work: Approximate association via dissociation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank
@@ Property / cites work @@
+Satgraphs and independent domination. I
@@ Property / cites work: Satgraphs and independent domination. I / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JCTB.2023.10.006
@@ Property / DOI: 10.1016/J.JCTB.2023.10.006 / rank @@
+Normal rank