Pages that link to "Item:Q2428696"
From MaRDI portal
The following pages link to Property testing on \(k\)-vertex-connectivity of graphs (Q2428696):
Displaying 10 items.
- Testing the \((s,t)\) connectivity of graphs and digraphs (Q428880) (← links)
- Testing connectivity of faulty networks in sublinear time (Q450565) (← links)
- Testing \(k\)-edge-connectivity of digraphs (Q469635) (← links)
- Testing outerplanarity of bounded degree graphs (Q494925) (← links)
- On the tree-width of even-hole-free graphs (Q1979431) (← links)
- Testing the supermodular-cut condition (Q2350909) (← links)
- Testing st-Connectivity (Q3603479) (← links)
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity (Q5189542) (← links)
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726) (← links)
- On testability of first-order properties in bounded-degree graphs and connections to proximity-oblivious testing (Q6573776) (← links)