On extremal sizes of locally k-tree graphs.
From MaRDI portal
Publication:3073497
DOI10.1007/S10587-010-0037-ZzbMATH Open1224.05246OpenAlexW2138854387WikidataQ62043619 ScholiaQ62043619MaRDI QIDQ3073497FDOQ3073497
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
Recommendations
Cites Work
- Algorithmic Aspects of Vertex Elimination on Graphs
- Title not available (Why is that?)
- Graphs with prescribed local connectivities
- Locally tree-like graphs
- Trahtenbrot-Zykov problem and NP-completeness
- Dense graphs with cycle neighborhoods
- A polynomial time algorithm recognizing link trees
- \(N_ 2\)-locally disconnected graphs
- On graphs with a local hereditary property
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sufficient conditions for edge-locally connected and $n$-connected graphs
- Locally path-like graphs
Cited In (9)
- Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\)
- Some extremal problems of graphs with local constraints
- Local tree-width, excluded minors, and approximation algorithms
- Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\)
- Title not available (Why is that?)
- A characterization of \(k\)-trees
- Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
- Lower bounds for locally highly connected graphs
- Title not available (Why is that?)
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)
