Michael Kubesa

According to our database, Michael Kubesa authored at least 9 papers between 2005 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2021

Decompositions of complete graphs into connected unicyclic bipartite graphs with seven edges.

Dalibor Froncek, Michael Kubesa

Bull. ICA, 2021

2020

Factorizations of complete graphs into tadpoles.

Michael Kubesa, Tom Raiman

AKCE Int. J. Graphs Comb., 2020

2012

Factorizations of complete graphs into brooms.

Petr Kovár, Michael Kubesa, Mariusz Meszka

Discret. Math., 2012

2011

Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices.

Dalibor Froncek, Petr Kovár, Michael Kubesa

Graphs Comb., 2011

2010

Factorizations of complete graphs into caterpillars of diameter 5.

Dalibor Froncek, Petr Kovár, Tereza Kovárová, Michael Kubesa

Discret. Math., 2010

Decompositions of complete graphs into blown-up cycles C_m[2].

Dalibor Froncek, Petr Kovár, Michael Kubesa

Discret. Math., 2010

2009

Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees.

Petr Kovár, Michael Kubesa

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2006

Problem presented at the workshop in Krynica 2004.

Michael Kubesa, Dalibor Froncek

Discuss. Math. Graph Theory, 2006

2005

Trees with <i>Α</i>-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees.

Michael Kubesa

Discuss. Math. Graph Theory, 2005