scientific article; zbMATH DE number 2174608
From MaRDI portal
Publication:4681981
zbMATH Open1067.05059MaRDI QIDQ4681981FDOQ4681981
Authors: Michael Kubesa 
Publication date: 9 June 2005
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1933250
- Bi-cyclic decompositions of complete graphs into spanning trees
- scientific article; zbMATH DE number 2235052
- Cyclic decompositions of complete graphs into spanning trees
- Factorizations of complete graphs into spanning trees with all possible maximum degrees
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (17)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bi-cyclic decompositions of complete graphs into spanning trees
- Factorizations of complete graphs into caterpillars of diameter 5
- Semirotational tree factorizations of complete graphs
- Spanning trees of descendants of a complete graph
- Factorizations of complete graphs into spanning trees with all possible maximum degrees
- Title not available (Why is that?)
- On graph labeling problems and regular decompositions of complete graphs
- Title not available (Why is that?)
- Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees
- Title not available (Why is that?)
- Spanning trees orthogonal to one-factorizations of \(K_{2n}\).
- Decompositions and factorizations of complete graphs
- Cyclic decompositions of complete graphs into spanning trees
- Factorizations of complete graphs into trees with at most four non-leave vertices
- Factorizations of complete graphs into brooms
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 Q4681981)
