Decomposing a graph into bistars |
| |
Authors: | Carsten Thomassen |
| |
Institution: | 1. Department of Mathematics, Technical University of Denmark, DK-2800 Lyngby, Denmark;2. King Abdulaziz University, Jeddah, Saudi Arabia |
| |
Abstract: | Bárat and the present author conjectured that, for each tree T , there exists a natural number kT such that the following holds: If G is a kT-edge-connected graph such that |E(T)| divides |E(G)|, then G has a T-decomposition, that is, a decomposition of the edge set into trees each of which is isomorphic to T . The conjecture has been verified for infinitely many paths and for each star. In this paper we verify the conjecture for an infinite family of trees that are neither paths nor stars, namely all the bistars S(k,k+1). |
| |
Keywords: | Orientations modulo k Bistar decomposition 3-Flow conjecture |
本文献已被 ScienceDirect 等数据库收录! |
|