The following pages link to (Q2721972):
Displaying 10 items.
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- The nonexistence of reduction rules giving an embedding into a \(k\)-tree (Q1336627) (← links)
- Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809) (← 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)
- Line graphs of bounded clique-width (Q2461201) (← 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)
