Pages that link to "Item:Q3679205"
From MaRDI portal
The following pages link to On the Cutwidth and the Topological Bandwidth of a Tree (Q3679205):
Displayed 20 items.
- A degree sequence method for the cutwidth problem of graphs (Q698370) (← links)
- The treewidth of line graphs (Q723884) (← links)
- Edge searching weighted graphs (Q1026157) (← links)
- Bounds on the convex label number of trees (Q1103629) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- Graphs with small bandwidth and cutwidth (Q1117949) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- The cutwidth of trees with diameters at most 4 (Q1430969) (← links)
- Minimal congestion trees (Q1877665) (← links)
- Decomposability of a class of \(k\)-cutwidth critical graphs (Q2125221) (← links)
- Perfect matching cuts partitioning a graph into complementary subgraphs (Q2169960) (← links)
- Four-searchable biconnected outerplanar graphs (Q2243137) (← links)
- Decompositions of critical trees with cutwidth \(k\) (Q2326339) (← links)
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481) (← links)
- Topological Bandwidth (Q3691781) (← links)
- (Q5089162) (← links)
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs (Q5748885) (← links)
- Partitioning a graph into complementary subgraphs (Q5918340) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
- Edge searching and fast searching with constraints (Q6122599) (← links)