scientific article; zbMATH DE number 1247777
In this work, graphs are assumed to be finite and connected. A map \(f:X\rightarrow Y\) between spaces \(X\) and \(Y\) is called universal if for each map \(g:X\rightarrow Y\), there exists \(x\in X\) such that \(f(x)=g(x)\). For any graph \(G\), let \(E_G\) denote the set of endpoints of \(G\). The main result of the paper is Theorem: Let \(f:G\rightarrow T\) be a map between a graph \(G\) and a tree \(T\). If \(f\) is light and universal and \(G\smallsetminus f^{- 1}(E_T)\) contains no simple closed curve, then there exists an embedding of \(T\) into \(G\). The author uses a method which involves a so-called first order reconstitution graph of \(G\). For some background, one may consult [\textit{C. Eberhart} and \textit{J. B. Fugate}, Trans. Am. Math. Soc. 350, No. 10, 4235-4251 (1998; Zbl 0908.54026)].
- Tree decompositions for a class of graphs
- A note on the tree decompositions of graphs
- scientific article; zbMATH DE number 866654
- Some results on tree decomposition of graphs
- Decomposition of complete graphs into arbitrary trees
- Decompositions of graphs into trees
- Tree-decompositions, tree-representability and chordal graphs
- Universal Graphs for Bounded-Degree Trees and Planar Graphs
- Tree-decompositions of graphs. I
- Decomposition of complete graphs and complete bipartite graphs into -labelled trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4227946)