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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q129192523, #quickstatements; #temporary_batch_1726329260436
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-018-1950-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2894418692 / rank
 
Normal rank
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
Property / Wikidata QID
 
Property / Wikidata QID: Q129192523 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:58, 14 September 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
    0 references