All tight descriptions of 3-paths in plane graphs with girth 8 (Q2182227): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Weight of 3-paths in sparse plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: All tight descriptions of 3-paths in plane graphs with girth at least 9 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 / rank
 
Normal rank
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: Minimal vertex degree sum of a 3-path in plane maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analogue of Franklin's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing 4-paths in 3-polytopes with minimum degree 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing tight descriptions of 3-paths in triangle-free normal plane maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6 / 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: Tight Descriptions of 3‐Paths in Normal Plane Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to the discharging method via graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4117038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths with restricted degrees of their vertices in planar graphs / 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: Describing short paths in plane graphs of girth at least 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal unavoidable sets of types of 3-paths for planar graphs of given girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-paths in graphs with bounded average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on 3-paths in plane graphs of girth 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On light subgraphs in plane graphs of minimum degree five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light subgraphs of graphs embedded in the plane. A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quelques consequences simples de la formule d'Euler / rank
 
Normal rank

Latest revision as of 18:35, 22 July 2024

scientific article
Language Label Description Also known as
English
All tight descriptions of 3-paths in plane graphs with girth 8
scientific article

    Statements

    All tight descriptions of 3-paths in plane graphs with girth 8 (English)
    0 references
    0 references
    0 references
    21 May 2020
    0 references
    plane graph
    0 references
    structure properties
    0 references
    tight description
    0 references
    3-path
    0 references
    minimum degree
    0 references
    height
    0 references
    weight
    0 references
    girth
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references