Pages that link to "Item:Q415271"

The following pages link to Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271):

Displaying 7 items.

• Practical and efficient circle graph recognition (Q472484) (← links)
• Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
• Enumerations, forbidden subgraph characterizations, and the split-decomposition (Q668013) (← links)
• Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
• A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
• Solving problems on graphs of high rank-width (Q1709595) (← links)
• On Strict (Outer-)Confluent Graphs (Q5084690) (← links)