Light 3-paths in 3-polytopes without adjacent triangles (Q6203328): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An analogue of Franklin's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Franklin's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without cycles of specific lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges / 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: On light subgraphs in plane graphs of minimum degree five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the weight of paths in plane triangulations of minimum degree 4 and 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5445043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9 / 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: An introduction to the discharging method via graph coloring / 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: Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4022062 / rank
 
Normal rank

Latest revision as of 09:11, 29 August 2024

scientific article; zbMATH DE number 7825243
Language Label Description Also known as
English
Light 3-paths in 3-polytopes without adjacent triangles
scientific article; zbMATH DE number 7825243

    Statements

    Light 3-paths in 3-polytopes without adjacent triangles (English)
    0 references
    0 references
    0 references
    27 March 2024
    0 references
    plane graph
    0 references
    3-polytope
    0 references
    sparse polytope
    0 references
    structural property
    0 references
    3-path
    0 references
    weight
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references