On the relations between arboricity and independent number or covering number (Q1270790): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Zhong Fu Zhang / rank
Normal rank
 
Property / author
 
Property / author: Jian-Xun Zhang / rank
Normal rank
 
Property / author
 
Property / author: Jian-fang Wang / rank
Normal rank
 
Property / author
 
Property / author: Zhong Fu Zhang / rank
 
Normal rank
Property / author
 
Property / author: Jian-Xun Zhang / rank
 
Normal rank
Property / author
 
Property / author: Jian-fang Wang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total covers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4147995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On point-linear arboricity of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the vertex linear arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear vertex-arboricity of a planar graph / rank
 
Normal rank

Latest revision as of 17:18, 28 May 2024

scientific article
Language Label Description Also known as
English
On the relations between arboricity and independent number or covering number
scientific article

    Statements

    On the relations between arboricity and independent number or covering number (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 November 1998
    0 references
    0 references
    vertex arboricity
    0 references
    edge arboricity
    0 references
    edge covering number
    0 references
    vertex independent number
    0 references
    edge independnet number
    0 references