Pages that link to "Item:Q1343147"
From MaRDI portal
The following pages link to \(k\)-connectivity and decomposition of graphs into forests (Q1343147):
Displaying 5 items.
- Sparse connectivity certificates via MA orderings in graphs (Q860401) (← links)
- A linear time algorithm for computing 3-edge-connected components in a multigraph (Q1199755) (← links)
- Sparse graph certificates for mixed connectivity (Q1781979) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- On sparse subgraphs preserving connectivity properties (Q4201383) (← links)
