A note on embedding graphs without short cycles (Q1883254): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4871134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every (p,p-2) graph is contained in its complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding graphs in their complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cyclically embeddable graphs / rank
 
Normal rank

Latest revision as of 11:16, 7 June 2024

scientific article
Language Label Description Also known as
English
A note on embedding graphs without short cycles
scientific article

    Statements

    A note on embedding graphs without short cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 October 2004
    0 references
    Embedding of graphs
    0 references
    Cycles
    0 references
    Embedding without fixed points
    0 references

    Identifiers