Pages that link to "Item:Q884481"
From MaRDI portal
The following pages link to MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481):
Displaying 45 items.
- Clique cycle-transversals in distance-hereditary graphs (Q299045) (← links)
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- Bounds and fixed-parameter algorithms for weighted improper coloring (Q737104) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Directed NLC-width (Q906393) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← 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)
- A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- On coloring a class of claw-free and hole-twin-free graphs (Q2091797) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs (Q2124227) (← links)
- On coloring a class of claw-free graphs. (Q2132368) (← links)
- On the structure of graphs without claw, \(4K_1\) and co-R (Q2158304) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- Partitioning graphs into induced subgraphs (Q2283104) (← links)
- Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153) (← links)
- The intersection of two vertex coloring problems (Q2303434) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- On some domination colorings of graphs (Q2399288) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Characterizations of \((4 K_1,C_4,C_5)\)-free graphs (Q2403803) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes (Q2819509) (← 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)
- Colouring square-free graphs without long induced paths. (Q3304134) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- Parameterized shifted combinatorial optimization (Q5915595) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs (Q6057651) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Coloring \((4K_1,C_4,C_6)\)-free graphs (Q6091816) (← links)
