z-logo
Premium
Some results on linear arboricity
Author(s) -
Guldan Filip
Publication year - 1986
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190100408
Subject(s) - arboricity , mathematics , graph , combinatorics , degeneracy (biology) , dense graph , discrete mathematics , pathwidth , line graph , planar graph , biology , bioinformatics
The linear arboricity of the graph G is the minimum number of linear forests whose union is G. In the paper exact values and bounds of linear arboricity for some additional classes of graphs are determined.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here