Pages that link to "Item:Q415285"

The following pages link to Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285):

Displayed 14 items.

• Clique-width with an inactive label (Q465271) ‎ (← links)
• Practical and efficient split decomposition via graph-labelled trees (Q472485) ‎ (← links)
• Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) ‎ (← links)
• The behavior of clique-width under graph operations and graph transformations (Q519907) ‎ (← links)
• Graph classes with and without powers of bounded clique-width (Q896650) ‎ (← links)
• Computing the clique-width of cactus graphs (Q1744436) ‎ (← links)
• Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) ‎ (← links)
• Clique-width and edge contraction (Q2350597) ‎ (← links)
• Rank-width: algorithmic and structural results (Q2403788) ‎ (← links)
• Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) ‎ (← links)
• A SAT Approach to Clique-Width (Q2946763) ‎ (← links)
• Digraphs of Bounded Width (Q3120441) ‎ (← links)
• Bounding the clique-width of \(H\)-free split graphs (Q5890917) ‎ (← links)
• Bounding the clique-width of \(H\)-free split graphs (Q5965534) ‎ (← links)