Pages that link to "Item:Q1764809"

The following pages link to Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809):

Displaying 18 items.

• Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
• The complexity of minimum-length path decompositions (Q494076) (← links)
• On the parameterized complexity of layered graph drawing (Q958215) (← links)
• An exact algorithm for subgraph homeomorphism (Q1044032) (← links)
• The nonexistence of reduction rules giving an embedding into a \(k\)-tree (Q1336627) (← links)
• Visibility representations of boxes in 2.5 dimensions (Q1615673) (← links)
• Embedding coverings of 2-paths with 3-paths (Q1876693) (← links)
• The paths embedding of the arrangement graphs with prescribed vertices in given position (Q1928512) (← links)
• On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
• (Q2721972) (← links)
• A Slice Theoretic Approach for Embedding Problems on Digraphs (Q2827823) (← links)
• A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q3448808) (← links)
• (Q4373680) (← links)
• Improved Lower Bounds for Graph Embedding Problems (Q5283358) (← links)
• A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q5376438) (← links)
• The Space Complexity of k-Tree Isomorphism (Q5387816) (← links)
• Dichotomies for tree minor containment with structural parameters (Q6575410) (← links)
• Dichotomies for tree minor containment with structural parameters (Q6658295) (← links)