Factorizations of complete graphs into tadpoles
Michael Kubesa, Tom Raiman
AKCE International Journal of Graphs and Combinatorics · 2020
doi:10.1016/j.akcej.2020.02.004 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
A tadpole (also a canoe paddle or lollipop) is a graph that arises from a cycle and a path by gluing a terminal vertex of the path to an arbitrary vertex of the cycle. In this article, we show that all tadpoles factorize the complete graph if n is odd. We use methods similar to those used for isomorphic factorizations of complete graphs into spanning trees. In of this article, we show that our methods do not work for isomorphic factorizations of into tadpoles if n is even.
Abstract licence: CC BY-NC
References8
8 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.