Pages that link to "Item:Q2368920"
From MaRDI portal
The following pages link to A degree bound on decomposable trees (Q2368920):
Displaying 30 items.
- Partitioning powers of traceable or Hamiltonian graphs (Q391776) (← links)
- On minimal arbitrarily partitionable graphs (Q456092) (← links)
- Structural properties of recursively partitionable graphs with connectivity 2 (Q505469) (← links)
- On the structure of arbitrarily partitionable graphs with given connectivity (Q741769) (← links)
- On the structure and deficiency of \(k\)-trees with bounded degree (Q908291) (← links)
- Decomposing trees with large diameter (Q986542) (← links)
- On-line arbitrarily vertex decomposable trees (Q997067) (← links)
- Arbitrarily vertex decomposable suns with few rays (Q1025573) (← links)
- On the shape of decomposable trees (Q1043555) (← links)
- On-line arbitrarily vertex decomposable suns (Q1045163) (← links)
- Decompositions of graphs into forests with bounded maximum degree (Q1185098) (← links)
- Decomposable trees: A polynomial algorithm for tripodes (Q1613342) (← links)
- Dense arbitrarily vertex decomposable graphs (Q1928285) (← links)
- Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs (Q2118240) (← links)
- More aspects of arbitrarily partitionable graphs (Q2158201) (← links)
- Decompositions of critical trees with cutwidth \(k\) (Q2326339) (← links)
- Partitioning the Cartesian product of a tree and a cycle (Q2333226) (← links)
- On the complexity of partitioning a graph into a few connected subgraphs (Q2352361) (← links)
- On arbitrarily vertex decomposable trees (Q2470004) (← links)
- Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\) (Q2857407) (← links)
- Some families of arbitrarily vertex decomposable graphs (Q3439380) (← links)
- Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles (Q3548725) (← links)
- (Q4980364) (← links)
- A note on bounds for the cop number using tree decompositions (Q5499967) (← links)
- An Ore-type condition for arbitrarily vertex decomposable graphs (Q5899376) (← links)
- An Ore-type condition for arbitrarily vertex decomposable graphs (Q5902102) (← links)
- On three polynomial kernels of sequences for arbitrarily partitionable graphs (Q5962512) (← links)
- Interplays between variations of arbitrarily partitionable graphs under minimality constraints (Q6571005) (← links)
- Closure results for arbitrarily partitionable graphs (Q6642846) (← links)
- Arbitrarily edge-partitionable graphs (Q6648283) (← links)
