Linear Arboricity and Linear k-Arboricity of Regular Graphs |
| |
| Authors: | Noga Alon V J Teague N C Wormald |
| |
| Institution: | (1) School of Mathematics, Institute for Advanced Study, Princeton, NJ 08540, USA and Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel. e-mail: noga@math.tau.ac.il, IL;(2) Department of Mathematics and Statistics, University of Melbourne, Parkville, VIC 3052, Australia. e-mail: 2vjt 3nick@ms.unimelb.edu.au, AU |
| |
| Abstract: | We find upper bounds on the linear k-arboricity of d-regular graphs using a probabilistic argument. For small k these bounds are new. For large k they blend into the known upper bounds on the linear arboricity of regular graphs.
Received: December 21, 1998 Final version received: July 26, 1999 |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
