Pages that link to "Item:Q2461201"
From MaRDI portal
The following pages link to Line graphs of bounded clique-width (Q2461201):
Displaying 21 items.
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Directed NLC-width (Q906393) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Complexity classification of the edge coloring problem for a family of graph classes (Q1675533) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- Computing the clique-width of cactus graphs (Q1744436) (← links)
- The intersection of two vertex coloring problems (Q2303434) (← links)
- Characterizations of \((4 K_1,C_4,C_5)\)-free graphs (Q2403803) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← 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)
- Tree-Width and Optimization in Bounded Degree Graphs (Q3508553) (← links)
- Excluding a bipartite circle graph from line graphs (Q3608319) (← links)
- Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
- Critical elements in combinatorially closed families of graph classes (Q5269161) (← links)
- (Q5878618) (← links)
- Graph functionality (Q5919068) (← links)
