Graphs with almost all edges in long cycles (Q1756098): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Maximal cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph coverings and edge switchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in 2-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The codiameter of a 2-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal circuits of graphs. I / rank
 
Normal rank

Revision as of 20:05, 17 July 2024

scientific article
Language Label Description Also known as
English
Graphs with almost all edges in long cycles
scientific article

    Statements

    Graphs with almost all edges in long cycles (English)
    0 references
    0 references
    0 references
    11 January 2019
    0 references
    cycles
    0 references
    2-connected graphs
    0 references
    extremal graphs
    0 references

    Identifiers

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