A tight description of 3-polytopes by their major 3-paths (Q2030764): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Weight of 3-paths in sparse plane 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: Minimal vertex degree sum of a 3-path in plane maps / 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: An analogue of Franklin's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6 / 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: Tight Descriptions of 3‐Paths in Normal Plane Maps / 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: Describing short paths in plane graphs of girth at least 5 / 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 extension of Franklin's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\) / rank
 
Normal rank

Revision as of 21:53, 25 July 2024

scientific article
Language Label Description Also known as
English
A tight description of 3-polytopes by their major 3-paths
scientific article

    Statements

    A tight description of 3-polytopes by their major 3-paths (English)
    0 references
    0 references
    0 references
    7 June 2021
    0 references
    plane graph
    0 references
    3-polytope
    0 references
    structural properties
    0 references
    3-path
    0 references
    tight description
    0 references

    Identifiers