Pages that link to "Item:Q2432547"
From MaRDI portal
The following pages link to Clique-width for 4-vertex forbidden subgraphs (Q2432547):
Displayed 36 items.
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
- Bichain graphs: geometric model and universal graphs (Q896651) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- A new characterization of \(P_{6}\)-free graphs (Q972332) (← links)
- A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) (← links)
- On coloring a class of claw-free and hole-twin-free graphs (Q2091797) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← 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)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- On the clique-width of \(( 4 K_1 , C_4 , C_5 , C_7 )\)-free graphs (Q2197487) (← links)
- Sandwiches missing two ingredients of order four (Q2288872) (← links)
- The intersection of two vertex coloring problems (Q2303434) (← 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)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← 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)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- On low rank-width colorings (Q5918207) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← 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)
- Functionality of box intersection graphs (Q6140059) (← links)