Describing 4-paths in 3-polytopes with minimum degree 5 (Q511329): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6684744 / rank
 
Normal rank
Property / zbMATH Keywords
 
planar graph
Property / zbMATH Keywords: planar graph / rank
 
Normal rank
Property / zbMATH Keywords
 
plane map
Property / zbMATH Keywords: plane map / rank
 
Normal rank
Property / zbMATH Keywords
 
structure properties
Property / zbMATH Keywords: structure properties / rank
 
Normal rank
Property / zbMATH Keywords
 
3-polytope
Property / zbMATH Keywords: 3-polytope / rank
 
Normal rank
Property / zbMATH Keywords
 
4-path
Property / zbMATH Keywords: 4-path / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3469114 / 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: 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: 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: Describing faces in plane triangulations / 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: 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: 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
Property / cites work
 
Property / cites work: Q5445043 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:04, 13 July 2024

scientific article
Language Label Description Also known as
English
Describing 4-paths in 3-polytopes with minimum degree 5
scientific article

    Statements

    Describing 4-paths in 3-polytopes with minimum degree 5 (English)
    0 references
    0 references
    0 references
    15 February 2017
    0 references
    0 references
    planar graph
    0 references
    plane map
    0 references
    structure properties
    0 references
    3-polytope
    0 references
    4-path
    0 references
    0 references
    0 references