Login
|
New Account
ITA
ENG
On the linear K-arboricity of cubic graphs
Authors
Vesel, A
Zerovnik, J
Citation
A. Vesel et J. Zerovnik, On the linear K-arboricity of cubic graphs, INT J COM M, 75(4), 2000, pp. 431-444
Citations number
13
Categorie Soggetti
Engineering Mathematics
Journal title
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
ISSN journal
00207160 →
ACNP
Volume
75
Issue
4
Year of publication
2000
Pages
431 - 444
Database
ISI
SICI code
Abstract
We prove by a computer search and an inductive construction that the edge s et of a cubic graph on n vertices can be partitioned into two k-linear fore sts, for [GRAPHICS]