On extremal sizes of locally k-tree graphs

DOI10.1007/s10587-010-0037-zzbMath1224.05246OpenAlexW2138854387WikidataQ62043619 ScholiaQ62043619MaRDI QIDQ3073497

Elżbieta Sidorowicz, Piotr Borowiecki, Mieczysław Borowiecki, Zdzisław Skupień

Publication date: 11 February 2011

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/38028

zbMATH Keywords

\(k\)-treeextremal problemlocal propertylocally tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (2)

Graphs \(G\) in which \(G-N[v\) has a prescribed property for each vertex \(v\)] ⋮ Lower bounds for locally highly connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trahtenbrot-Zykov problem and NP-completeness
• Graphs with prescribed local connectivities
• \(N_ 2\)-locally disconnected graphs
• Dense graphs with cycle neighborhoods
• Locally tree-like graphs
• Sufficient conditions for edge-locally connected and $n$-connected graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• A polynomial time algorithm recognizing link trees
• Locally path-like graphs
• On graphs with a local hereditary property

This page was built for publication: On extremal sizes of locally k-tree graphs