Bi-cyclic decompositions of complete graphs into spanning trees
From MaRDI portal
Publication:878620
DOI10.1016/J.DISC.2003.11.061zbMATH Open1118.05079OpenAlexW2019204428MaRDI QIDQ878620FDOQ878620
Authors: Dalibor Fronček 
Publication date: 26 April 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.061
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
Cited In (13)
- Factorizations of complete graphs into tadpoles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factorizations of complete graphs into caterpillars of diameter 5
- Factorizations of complete graphs into spanning trees with all possible maximum degrees
- -labeling of supersubdivided connected graph plus an edge
- A note on heterogeneous decompositions into spanning trees
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Factorizations of complete graphs into brooms
This page was built for publication: Bi-cyclic decompositions of complete graphs into spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878620)
