Pages that link to "Item:Q2277470"
From MaRDI portal
The following pages link to A recursive characterization of the 4-connected graphs (Q2277470):
Displayed 17 items.
- On the structure of \(C_3\)-critical minimal 6-connected graphs (Q291173) (← links)
- Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4 (Q744553) (← links)
- On the structure of contractible edges in \(k\)-connected partial \(k\)-trees (Q844219) (← links)
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs (Q859615) (← links)
- Bisecting a 4-connected graph with three resource sets (Q997070) (← links)
- The structure of quasi 4-connected graphs (Q1356425) (← links)
- Splitting and contractible edges in 4-connected graphs (Q1400957) (← links)
- Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph (Q1792054) (← links)
- On local structure of 9- and 10-connected graphs (Q1930222) (← links)
- On vertices of degree 6 of minimal and contraction critical 6-connected graph (Q2027317) (← links)
- Local structure of 5- and 6-connected graphs (Q2256705) (← links)
- Local structure of 7- and 8-connected graphs (Q2256706) (← links)
- Reduction for 3-connected graphs of minimum degree at least four (Q2373428) (← links)
- On the number of 4-contractible edges in 4-connected graphs (Q2519017) (← links)
- High connectivity keeping sets in graphs and digraphs (Q2575793) (← links)
- Reductions of 3-connected graphs with minimum degree at least four (Q3177643) (← links)
- 5-Shredders of Contraction-Critical 5-Connected Graphs (Q5087061) (← links)