Pages that link to "Item:Q4875439"

The following pages link to On Linear Recognition of Tree-Width at Most Four (Q4875439):

Displaying 10 items.

• Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
• Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
• Three-connected graphs whose maximum nullity is at most three (Q929488) (← links)
• An implementation of the iterative proportional fitting procedure by propagation trees. (Q1606471) (← links)
• The structure of obstructions to treewidth and pathwidth (Q1613365) (← links)
• Surfaces, tree-width, clique-minors, and partitions (Q1850479) (← links)
• Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• Constructive linear time algorithms for branchwidth (Q4571992) (← links)
• Connected search for a lazy robber (Q6080862) (← links)