On extremal bipartite graphs with high girth (Q3439643): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the girth of extremal graphs without shortest cycles / 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: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance connectivity of graphs and digraphs / 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 the structure of extremal graphs of high girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank

Latest revision as of 19:13, 25 June 2024

scientific article
Language Label Description Also known as
English
On extremal bipartite graphs with high girth
scientific article

    Statements

    On extremal bipartite graphs with high girth (English)
    0 references
    0 references
    0 references
    0 references
    29 May 2007
    0 references
    extremal graph
    0 references
    bipartite graph
    0 references
    girth
    0 references

    Identifiers