AbstractWe examine decompositions of complete graphs K4k+2 into 2k+1 isomorphic spanning trees. We develop a method of factorization based on a new type of vertex labelling, namely blended ρ-labelling. We also show that for every k⩾1 and every d,3⩽d⩽4k+1 there is a tree with diameter d that decomposes K4k+2 into 2k+1 factors isomorphic to T
AbstractR. Häggkvist proved that every 3-regular bipartite graph of order 2n with no component isomo...
Brualdi and Hollingsworth conjectured in Brualdi and Hollingsworth (1996) that in any complete graph...
A tadpole (also a canoe paddle or lollipop) is a graph that arises from a cycle and a path by gluing...
AbstractWe examine decompositions of complete graphs K4k+2 into 2k+1 isomorphic spanning trees. We d...
Issues 11-12 (2007): The Fourth Caracow Conference on Graph Theory, Czorsztyn, Poland, 2002.We exami...
We examine decompositions of complete graphs with an even number of vertices, $K_{2n}$, into n isomo...
We examine constructions of non-symmetric trees with a flexible q-labeling or an α-like labeling, wh...
This master’s thesis in graph theory focuses on graph decomposition. In practice, various forms of g...
AbstractLet r and n be positive integers with r<2n. A broom of order 2n is the union of the path on ...
Abstract. In 1967, A. Rosa proved that if a bipartite graph G with n edges has an α-labeling, then f...
Abstract. In 1967, A. Rosa proved that if a bipartite graph G with n edges has an α-labeling, then f...
A 1-factorization F of a complete graph K2n is said to be G-regular, or regular under G, if G is an...
A 1-factorization F of a complete graph K2n is said to be G-regular, or regular under G, if G is an...
AbstractThe paper presents some results on graphs that do not have two distinct isomorphic spanning ...
AbstractIn this paper, we revisit the split decomposition of graphs and give new combinatorial and a...
AbstractR. Häggkvist proved that every 3-regular bipartite graph of order 2n with no component isomo...
Brualdi and Hollingsworth conjectured in Brualdi and Hollingsworth (1996) that in any complete graph...
A tadpole (also a canoe paddle or lollipop) is a graph that arises from a cycle and a path by gluing...
AbstractWe examine decompositions of complete graphs K4k+2 into 2k+1 isomorphic spanning trees. We d...
Issues 11-12 (2007): The Fourth Caracow Conference on Graph Theory, Czorsztyn, Poland, 2002.We exami...
We examine decompositions of complete graphs with an even number of vertices, $K_{2n}$, into n isomo...
We examine constructions of non-symmetric trees with a flexible q-labeling or an α-like labeling, wh...
This master’s thesis in graph theory focuses on graph decomposition. In practice, various forms of g...
AbstractLet r and n be positive integers with r<2n. A broom of order 2n is the union of the path on ...
Abstract. In 1967, A. Rosa proved that if a bipartite graph G with n edges has an α-labeling, then f...
Abstract. In 1967, A. Rosa proved that if a bipartite graph G with n edges has an α-labeling, then f...
A 1-factorization F of a complete graph K2n is said to be G-regular, or regular under G, if G is an...
A 1-factorization F of a complete graph K2n is said to be G-regular, or regular under G, if G is an...
AbstractThe paper presents some results on graphs that do not have two distinct isomorphic spanning ...
AbstractIn this paper, we revisit the split decomposition of graphs and give new combinatorial and a...
AbstractR. Häggkvist proved that every 3-regular bipartite graph of order 2n with no component isomo...
Brualdi and Hollingsworth conjectured in Brualdi and Hollingsworth (1996) that in any complete graph...
A tadpole (also a canoe paddle or lollipop) is a graph that arises from a cycle and a path by gluing...
DOI
Add to ORKG