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 18 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)
• Topology and counting of real algebraic curves (Q2149421) (← links)
• From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
• Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
• On strict (outer-)confluent graphs (Q2206846) (← links)
• A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
• Modular decomposition of graphs and the distance preserving property (Q2312661) (← links)
• An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
• Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
• The Structure of Level-k Phylogenetic Networks (Q3637120) (← links)
• Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
• On Strict (Outer-)Confluent Graphs (Q5084690) (← links)
• A polynomial kernel for distance-hereditary vertex deletion (Q5918311) (← links)