On the linear K-arboricity of cubic graphs

Aleksander Vesel Department of Mathematics, PEF, University of Maribor, Koroška c. 160, Maribor, 2000, SloveniaCorrespondence[email protected]

Janez Žerovnik Faculty of Mechanical Engineering, Department of Theoretical Computer Science, University of Maribor, Institute of Mathematics, Physics and Mechanics, Smetanova 17, Maribor, Ljubljana, 2000, Slovenia

Abstract

We prove by a computer search and an inductive construction that the edge set of a cubic graph on n vertices can be partitioned into two k-linear forests, for

Keywords:

C.R. Categories:

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

On the linear K-arboricity of cubic graphs

Information for

Open access

Opportunities

Help and information

On the linear K-arboricity of cubic graphs

Abstract

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date

Your download is now in progress and you may close this window

Login or register to access this feature