Pages that link to "Item:Q1861574"
From MaRDI portal
The following pages link to Edge dominating set and colorings on graphs with fixed clique-width (Q1861574):
Displaying 50 items.
- Data reduction for graph coloring problems (Q393081) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Directed NLC-width (Q906393) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (Q1662648) (← links)
- Complexity classification of the edge coloring problem for a family of graph classes (Q1675533) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- On coloring a class of claw-free graphs. (Q2132368) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- The computational complexity of three graph problems for instances with bounded minors of constraint matrices (Q2357129) (← links)
- Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
- On powers of graphs of bounded NLC-width (clique-width) (Q2383546) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- Obstructions for linear rank-width at most 1 (Q2442201) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes (Q2819509) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Linear Clique‐Width for Hereditary Classes of Cographs (Q2978187) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
- On the Boolean-Width of a Graph: Structure and Applications (Q3057622) (← links)
