Describing tight descriptions of 3-paths in triangle-free normal plane maps (Q2352059): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the total coloring of planar graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint extension of two theorems of Kotzig on 3-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal vertex degree sum of a 3-path in plane maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing 3-paths in normal plane maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4117038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural property of convex 3-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths with restricted degrees of their vertices in planar graphs / rank
 
Normal rank

Latest revision as of 11:13, 10 July 2024

scientific article
Language Label Description Also known as
English
Describing tight descriptions of 3-paths in triangle-free normal plane maps
scientific article

    Statements

    Describing tight descriptions of 3-paths in triangle-free normal plane maps (English)
    0 references
    0 references
    0 references
    29 June 2015
    0 references
    0 references
    normal plane map
    0 references
    planar graph
    0 references
    structure properties
    0 references
    3-path
    0 references
    weight
    0 references
    0 references