Sequences Characterizing k-Trees
From MaRDI portal
Recommendations
Cited in
(17)- Enumerative sequences of leaves and nodes in rational trees
- Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices
- An extremal problem for a graphic sequence to have a realization containing every 2-tree with prescribed size
- Reconstructing cactus graphs from shortest path information (extended abstract)
- scientific article; zbMATH DE number 3841909 (Why is no real title available?)
- On the number of degree sequences of a tree with n nodes
- scientific article; zbMATH DE number 1223556 (Why is no real title available?)
- On the degree sequences of maximal outerplanar graphs.
- scientific article; zbMATH DE number 1822151 (Why is no real title available?)
- scientific article; zbMATH DE number 7267318 (Why is no real title available?)
- The sparse sequences of graphs
- Approximate realizations for outerplanaric degree sequences
- Degree realization by bipartite cactus graphs
- Approximate realizations for outerplanaric degree sequences
- On key parameters affecting the realizability of degree sequences (invited paper)
- Identifying \(X\)-trees with few characters
- Arbres et suites majeures. (Trees and major sequences)
This page was built for publication: Sequences Characterizing k-Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591347)