On the girth of extremal graphs without shortest cycles (Q998448): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2007.10.037 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.10.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978339393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimum Order of Extremal Graphs to have a Prescribed Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally connected digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3490015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs without three‐cycles or four‐cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4024328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of Regular Directed Graphs with Small Diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of extremal graphs of high girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cages—a survey / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2007.10.037 / rank
 
Normal rank

Latest revision as of 12:07, 10 December 2024

scientific article
Language Label Description Also known as
English
On the girth of extremal graphs without shortest cycles
scientific article

    Statements

    On the girth of extremal graphs without shortest cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 January 2009
    0 references
    extremal graphs
    0 references
    girth
    0 references
    forbidden cycles
    0 references
    cages
    0 references

    Identifiers