On extremal sizes of locally k-tree graphs.
From MaRDI portal
Recommendations
Cites work
- \(N_ 2\)-locally disconnected graphs
- A polynomial time algorithm recognizing link trees
- Algorithmic Aspects of Vertex Elimination on Graphs
- Dense graphs with cycle neighborhoods
- Graphs with prescribed local connectivities
- scientific article; zbMATH DE number 4085709 (Why is no real title available?)
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- scientific article; zbMATH DE number 4183433 (Why is no real title available?)
- Locally path-like graphs
- Locally tree-like graphs
- On graphs with a local hereditary property
- Sufficient conditions for edge-locally connected and n-connected graphs
- Trahtenbrot-Zykov problem and NP-completeness
Cited in
(10)- A characterization of \(k\)-trees
- Some extremal problems of graphs with local constraints
- Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
- Local tree-width, excluded minors, and approximation algorithms
- Lower bounds for locally highly connected graphs
- scientific article; zbMATH DE number 729923 (Why is no real title available?)
- scientific article; zbMATH DE number 4118411 (Why is no real title available?)
- Bounding mean orders of sub-k-trees of k-trees
- Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\)
- Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\)
This page was built for publication: On extremal sizes of locally \(k\)-tree graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073497)
