On extremal sizes of locally k-tree graphs.

DOI10.1007/S10587-010-0037-ZMaRDI QIDQ3073497zbMATHOpenAlexWikidataFDO

Authors Mieczysław Borowiecki, Piotr Borowiecki, Elżbieta Sidorowicz, 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

extremal problem\(k\)-treelocal propertylocally tree

Mathematics Subject Classification ID

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

Recommendations

• A characterization of \(k\)-trees
• Independence number and \(k\)-trees of graphs
• On a characterization of \(k\)-trees.
• Some extremal problems of graphs with local constraints
• scientific article; zbMATH DE number 4103086

Cites work

• 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?)
• A polynomial time algorithm recognizing link trees
• Algorithmic Aspects of Vertex Elimination on Graphs
• Dense graphs with cycle neighborhoods
• Graphs with prescribed local connectivities
• 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
• \(N_ 2\)-locally disconnected graphs

Cited in

(10)

• Lower bounds for locally highly connected graphs
• scientific article; zbMATH DE number 729923 (Why is no real title available?)
• Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\)
• Some extremal problems of graphs with local constraints
• Local tree-width, excluded minors, and approximation algorithms
• scientific article; zbMATH DE number 4118411 (Why is no real title available?)
• A characterization of \(k\)-trees
• Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\)
• Bounding mean orders of sub-\(k\)-trees of \(k\)-trees
• Graphs \(G\) in which \(G-N[v]\) has a prescribed property 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)