An analogue of Franklin's theorem (Q294562): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Oleg V. Borodin / rank
Normal rank
 
Property / author
 
Property / author: Anna O. Ivanova / rank
Normal rank
 
Property / author
 
Property / author: Oleg V. Borodin / rank
 
Normal rank
Property / author
 
Property / author: Anna O. Ivanova / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2016.04.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2395118107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weight of 3-paths in sparse plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3469114 / 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: Minimal vertex degree sum of a 3-path in plane maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing 3-faces in normal plane maps with minimum degree 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 / 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: 5-stars of low weight in normal plane maps with minimum degree 5 / 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: 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: Describing faces in plane triangulations / 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: 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: On doubly light triangles in plane 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: Paths with restricted degrees of their vertices in planar graphs / 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: Light subgraphs of graphs embedded in the plane. A survey / 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: Note on 3-paths in plane graphs of girth 4 / 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: On the structure of plane graphs of minimum face size 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5445043 / 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

Latest revision as of 03:46, 12 July 2024

scientific article
Language Label Description Also known as
English
An analogue of Franklin's theorem
scientific article

    Statements

    An analogue of Franklin's theorem (English)
    0 references
    16 June 2016
    0 references
    planar graph
    0 references
    plane map
    0 references
    structure properties
    0 references
    3-polytope
    0 references
    weight
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers