Edge covering pseudo-outerplanar graphs with forests (Q449118): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Gui Zhen Liu / rank
 
Normal rank
Property / author
 
Property / author: Jian Liang Wu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964301131 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1108.3877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering planar graphs with forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Planar linear arboricity conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering planar graphs with forests, one having bounded maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: COVERING AND PACKING IN GRAPHS, I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge and total choosability of near-outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge-colorings of series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs of maximum degree seven are Class I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4528373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arboricity of series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arboricity of planar graphs of maximum degree seven is four / rank
 
Normal rank

Latest revision as of 16:52, 5 July 2024

scientific article
Language Label Description Also known as
English
Edge covering pseudo-outerplanar graphs with forests
scientific article

    Statements

    Edge covering pseudo-outerplanar graphs with forests (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    pseudo-outerplanar graphs
    0 references
    edge decomposition
    0 references
    edge chromatic number
    0 references
    linear arboricity
    0 references
    0 references
    0 references