Michael Kubesa

Available identifiers

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5032429	2022-02-16	Paper
Factorizations of complete graphs into tadpoles	2021-09-01	Paper
Factorizations of complete graphs into brooms	2012-04-13	Paper
Factorizations of complete graphs into trees with at most four non-leave vertices	2012-01-24	Paper
Rectangular table negotiation problem revisited	2012-01-16	Paper
Decompositions of complete graphs into blown-up cycles \(C_m\)[2]	2010-04-27	Paper
Factorizations of complete graphs into caterpillars of diameter 5	2010-03-29	Paper
Factorizations of complete graphs into spanning trees with all possible maximum degrees	2009-12-11	Paper
Problem D. Froncek and M. Kubesa	2008-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q5755112	2007-08-20	Paper
Factorizations of complete graphs into \([n,r,s,2]\)-caterpillars of diameter 5 with maximum end	2007-06-25	Paper
Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees	2006-10-16	Paper
https://portal.mardi4nfdi.de/entity/Q5488356	2006-09-14	Paper
https://portal.mardi4nfdi.de/entity/Q5710446	2005-12-02	Paper
https://portal.mardi4nfdi.de/entity/Q4681981	2005-06-09	Paper
Factorizations of complete graphs into \([n,r,s,2]\)-caterpillars of diameter 5 with maximum center	2005-05-03	Paper
https://portal.mardi4nfdi.de/entity/Q4405789	2003-06-23	Paper

This page was built for person: Michael Kubesa