Pages that link to "Item:Q3073497"

The following pages link to On extremal sizes of locally k-tree graphs (Q3073497):

Displaying 7 items.

• Lower bounds for locally highly connected graphs (Q343698) (← links)
• A characterization of \(k\)-trees (Q1198515) (← links)
• Some extremal problems of graphs with local constraints (Q1613466) (← links)
• Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\) (Q2146735) (← links)
• Local tree-width, excluded minors, and approximation algorithms (Q2494422) (← 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)