Factorizations of complete graphs into tadpoles

DOI10.1016/J.AKCEJ.2020.02.004MaRDI QIDQ4956196zbMATH OpenOpenAlexWikidataFDO

Authors Michael Kubesa, Tom Raiman

Publication date 1 September 2021

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.akcej.2020.02.004

zbMATH Keywords

complete graphfactorizationtadpoleunicyclic graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph designs and isomorphic decomposition (05C51) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Factorizations of complete graphs into caterpillars of diameter 5
• Decompositions of complete graphs into kayak paddles with two odd cycles
• Factorizations of complete graphs into \([n,r,s,2]\)-caterpillars of diameter 5 with maximum center
• Tadpole domination number of graphs
• Decompositions of complete graphs into kayak paddles

Cites work

• Bi-cyclic decompositions of complete graphs into spanning trees
• Cyclic decompositions of complete graphs into spanning trees
• Factorizations of \(K_{m,n}\) into spanning trees
• Factorizations of complete graphs into caterpillars of diameter 5
• Factorizations of complete graphs into spanning trees with all possible maximum degrees
• Factorizations of complete graphs into trees with at most four non-leave vertices
• scientific article; zbMATH DE number 3885963 (Why is no real title available?)
• scientific article; zbMATH DE number 1933250 (Why is no real title available?)

Cited in

(5)

• Decompositions of complete graphs into kayak paddles with two odd cycles
• Balanced and strongly balanced (m, n)-tadpole systems
• Decompositions of complete graphs into kayak paddles
• scientific article; zbMATH DE number 6470737 (Why is no real title available?)
• Tadpole domination number of graphs

This page was built for publication: Factorizations of complete graphs into tadpoles

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