Pages that link to "Item:Q2383546"
From MaRDI portal
The following pages link to On powers of graphs of bounded NLC-width (clique-width) (Q2383546):
Displayed 4 items.
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698) (← links)