Pages that link to "Item:Q3073497"
From MaRDI portal
The following pages link to On extremal sizes of locally k-tree graphs (Q3073497):
Displaying 4 items.
- Lower bounds for locally highly connected graphs (Q343698) (← links)
- Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\) (Q2146735) (← links)
- Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\) (Q6569097) (← links)
- Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\) (Q6581900) (← links)