Pages that link to "Item:Q2369007"
From MaRDI portal
The following pages link to Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007):
Displaying 17 items.
- Constant-degree graph expansions that preserve treewidth (Q633842) (← links)
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- The balanced satisfactory partition problem (Q831826) (← links)
- Efficient algorithms for decomposing graphs under degree constraints (Q881575) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Structural and algorithmic properties of 2-community structures (Q1635716) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
- Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs (Q3188882) (← links)
- New upper bounds on the decomposability of planar graphs (Q3376690) (← links)
- New Insight into 2-Community Structures in Graphs with Applications in Social Networks (Q3467849) (← links)
- Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time (Q3652285) (← links)
- (Q5002797) (← links)
- Parameterized complexity of satisfactory partition problem (Q5918491) (← links)
- Decomposing planar graphs into graphs with degree restrictions (Q6081583) (← links)
- Degree sequence optimization in bounded treewidth (Q6097483) (← links)
