Pages that link to "Item:Q1974445"
From MaRDI portal
The following pages link to Linear time solvable optimization problems on graphs of bounded clique-width (Q1974445):
Displaying 50 items.
- Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
- Parameterized Complexity of Geodetic Set (Q5050005) (← links)
- Acyclic polynomials of graphs (Q5080911) (← links)
- On Strict (Outer-)Confluent Graphs (Q5084690) (← links)
- (Q5089163) (← links)
- (Q5089227) (← links)
- Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
- Uniformly Automatic Classes of Finite Structures (Q5090943) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- (Q5111290) (← links)
- (Q5111878) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Partial complementation of graphs (Q5116485) (← links)
- Finer Tight Bounds for Coloring on Clique-Width (Q5130905) (← links)
- (Q5136270) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width (Q5173247) (← links)
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES (Q5249049) (← links)
- Critical elements in combinatorially closed families of graph classes (Q5269161) (← links)
- Complexity of the Packing Coloring Problem for Trees (Q5302050) (← links)
- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width (Q5302060) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers (Q5458553) (← links)
- A Logical Approach to Constraint Satisfaction (Q5504702) (← links)
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH (Q5696971) (← links)
- (Q5856407) (← links)
- Quadruple Roman domination in graphs (Q5866033) (← links)
- (Q5874480) (← links)
- (Q5874504) (← links)
- First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) (← links)
- Canonisation and Definability for Graphs of Bounded Rank Width (Q5875948) (← links)
- Some cases of polynomial solvability for the edge colorability problem generated by forbidden 8-edge subcubic forests (Q5878618) (← links)
- (Q5884490) (← links)
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs (Q5890507) (← links)
- Parameterized aspects of triangle enumeration (Q5915757) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
- An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width (Q5918121) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- On low rank-width colorings (Q5918207) (← links)
- A polynomial kernel for distance-hereditary vertex deletion (Q5918311) (← links)
- Clique-width of point configurations (Q5918571) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5918841) (← links)
- Graph functionality (Q5919068) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5920175) (← links)
- On structural parameterizations of firefighting (Q5920210) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
