Factorizations of complete graphs into trees with at most four non-leave vertices

DOI10.1007/S00373-010-0991-0zbMATH Open1234.05186OpenAlexW2093027527WikidataQ114229687 ScholiaQ114229687MaRDI QIDQ659732FDOQ659732

Michael Kubesa, P. Kovář, Dalibor Fronček

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0991-0

zbMATH Keywords

spanning treesgraph factorizationgraph labeling

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Factorizations of complete graphs into \([n,r,s,2]\)-caterpillars of diameter 5 with maximum center
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bi-cyclic decompositions of complete graphs into spanning trees
• Title not available (Why is that?)

Cited In (2)

• Factorizations of complete graphs into tadpoles
• Title not available (Why is that?)

This page was built for publication: Factorizations of complete graphs into trees with at most four non-leave vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659732)