Pages that link to "Item:Q4652630"
From MaRDI portal
The following pages link to On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree (Q4652630):
Displaying 47 items.
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Constant-degree graph expansions that preserve treewidth (Q633842) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- On the maximum independent set problem in graphs of bounded maximum degree (Q778157) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs (Q976141) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- Tree-width dichotomy (Q2136198) (← links)
- Coloring vertices of claw-free graphs in three colors (Q2251141) (← 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)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- A Boundary Property for Upper Domination (Q2819507) (← 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)
- Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width (Q3007630) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
- Colouring square-free graphs without long induced paths. (Q3304134) (← links)
- Tree-Width and Optimization in Bounded Degree Graphs (Q3508553) (← links)
- Boundary Classes of Planar Graphs (Q3512606) (← links)
- Deciding Clique-Width for Graphs of Bounded Tree-Width (Q4435348) (← links)
- Coloring Graphs with Constraints on Connectivity (Q4978449) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width (Q5405029) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- Graph functionality (Q5919068) (← links)
- On structural parameterizations of firefighting (Q5920210) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)
- Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded (Q6038594) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- On 3-degree 4-chordal graphs (Q6174132) (← links)
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints (Q6657233) (← links)
