Loading...
Please wait, while we are loading the content...
Similar Documents
C O ] 2 9 M ay 2 01 9 Bipartite partition-connected factors with small degrees
| Content Provider | Semantic Scholar |
|---|---|
| Author | Hasanvand, Morteza |
| Copyright Year | 2019 |
| Abstract | In this paper, we show that every 2m-partition-connected graph G has a bipartite m-partitionconnected factor H such that for each vertex v, dH(v) ≤ ⌈ 3 4 dG(v)⌉. A graph H is said to be mpartition-connected, if it contains m edge-disjoint spanning trees. As an application, we conclude that tough enough graphs with appropriate number of vertices have a bipartite m-partition-connected factor with maximum degree at most 3m+1. Finally, we prove that tough enough graphs of order at least 3k admit a bipartite connected factor whose degrees lie in the set {k, 2k, 3k, 4k}. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://arxiv-export-lb.library.cornell.edu/pdf/1905.12161 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
