On the Number of Cycles in a Graph with Restricted Cycle Lengths (Q4602855): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Many \(T\) copies in \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pentagons vs. triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of even length in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of five-cycles in a triangle-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of \(C_ 5's\) in a triangle-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of pentagons in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on graphs without short even cycles / rank
 
Normal rank

Latest revision as of 01:56, 15 July 2024

scientific article; zbMATH DE number 6835623
Language Label Description Also known as
English
On the Number of Cycles in a Graph with Restricted Cycle Lengths
scientific article; zbMATH DE number 6835623

    Statements

    On the Number of Cycles in a Graph with Restricted Cycle Lengths (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 February 2018
    0 references
    cycles
    0 references
    extremal problems
    0 references
    directed graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references