The following pages link to Algorithm Theory - SWAT 2004 (Q5315376):
Displaying 13 items.
- A cubic algorithm for the directed Eulerian subgraph problem (Q806684) (← links)
- Edge reductions in cyclically \(k\)-connected cubic graphs (Q922553) (← links)
- Cycles through edges in cyclically \(k\)-connected cubic graphs (Q1196754) (← links)
- Matching theory and Barnette's conjecture (Q2099486) (← links)
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs (Q2131857) (← links)
- The \(k\)-subconnectedness of planar graphs (Q2133309) (← links)
- The cubic graphs with finite cyclic vertex connectivity larger than girth (Q2214044) (← links)
- Characterization of \(k\)-subconnected graphs (Q2284049) (← links)
- A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\) (Q2424662) (← links)
- A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs (Q2424828) (← links)
- Characterization of graphs with infinite cyclic edge connectivity (Q2483391) (← links)
- A polynomial algorithm for cyclic edge connectivity of cubic graphs (Q2760446) (← links)
- (Q4216611) (← links)
