Pages that link to "Item:Q1028448"

The following pages link to The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448):

Displayed 9 items.

• Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) ‎ (← links)
• Linear rank-width and linear clique-width of trees (Q2346380) ‎ (← links)
• Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) ‎ (← links)
• Computing square roots of trivially perfect and threshold graphs (Q2446337) ‎ (← links)
• Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) ‎ (← links)
• (Q5089163) ‎ (← links)
• On low rank-width colorings (Q5918207) ‎ (← links)
• A polynomial kernel for 3-leaf power deletion (Q6046945) ‎ (← links)
• Recognizing <i>k</i> -Leaf Powers in Polynomial Time, for Constant <i>k</i> (Q6075860) ‎ (← links)