Pages that link to "Item:Q5249046"
From MaRDI portal
The following pages link to <font>NLC</font><sub>2</sub>-DECOMPOSITION IN POLYNOMIAL TIME (Q5249046):
Displaying 10 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)
- Well-quasi-order of relabel functions (Q603891) (← links)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
- Characterizations for restricted graphs of NLC-width 2 (Q870845) (← links)
- On a disparity between relative cliquewidth and relative NLC-width (Q972344) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)
- (Q4944972) (← links)