New families of graphs without short cycles and large size (Q708348): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2010.03.007 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The Moore bound for irregular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of bi-regular cages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the girth of extremal graphs without shortest cycles / 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: Q5183530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Regular Graphs of Girths Eight and Twelve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions for cubic graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5677530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonexistence of certain generalized polygons / 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: On Moore Graphs with Diameters 2 and 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new series of dense graphs of high girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3312262 / 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: Q4002255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using simulated annealing to construct extremal graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2010.03.007 / rank
 
Normal rank

Latest revision as of 01:25, 10 December 2024

scientific article
Language Label Description Also known as
English
New families of graphs without short cycles and large size
scientific article

    Statements

    New families of graphs without short cycles and large size (English)
    0 references
    0 references
    0 references
    0 references
    11 October 2010
    0 references
    extremal graph
    0 references
    cages
    0 references
    extremal function
    0 references

    Identifiers