Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 (Q393180): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Properties of Planar Maps with the Minimal Degree 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural theorem on plane graphs with application to the entire coloring number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings of plane graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short cycles of low weight in normal plane maps with minimum degree 5 / 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: Q4085741 / 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: On light cycles in plane triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4410027 / 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: Q5344765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518403 / 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: Q5659560 / rank
 
Normal rank

Latest revision as of 06:31, 7 July 2024

scientific article
Language Label Description Also known as
English
Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11
scientific article

    Statements

    Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 (English)
    0 references
    0 references
    0 references
    0 references
    16 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    planar graph
    0 references
    plane map
    0 references
    structure properties
    0 references
    3-polytope
    0 references
    weight
    0 references
    0 references