Bounds on the number of cycles of length three in a planar graph (Q1163566): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5547252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytopes, graphs, and complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of cycles of lengthk in a maximal planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of triangles in a triangulation of a set of points in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Planar Graphical Degree Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Separable and Planar Graphs / rank
 
Normal rank

Latest revision as of 14:34, 13 June 2024

scientific article
Language Label Description Also known as
English
Bounds on the number of cycles of length three in a planar graph
scientific article

    Statements

    Bounds on the number of cycles of length three in a planar graph (English)
    0 references
    1982
    0 references
    planar graph with nontriangular faces
    0 references
    0 references
    0 references

    Identifiers