Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 (Q748469): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Oleg V. Borodin / rank
Normal rank
 
Property / author
 
Property / author: Oleg V. Borodin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quelques consequences simples de la formule d'Euler / 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: Short cycles of low weight in normal plane maps with minimum degree 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ensemble phase-averaged equations for bubbly flows / 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: Q4085741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 / 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: On light cycles in plane triangulations / 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: Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 / 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: Structural Properties of Planar Maps with the Minimal 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: Structural theorem on plane graphs with application to the entire coloring number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s0037446615040059 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2250143022 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:50, 30 July 2024

scientific article
Language Label Description Also known as
English
Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15
scientific article

    Statements

    Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 (English)
    0 references
    0 references
    0 references
    29 October 2015
    0 references
    plane graph
    0 references
    structural properties
    0 references
    3-polytope
    0 references
    height
    0 references

    Identifiers

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