Extremal non-bipartite regular graphs of girth 4 (Q5896181): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the connection between chromatic number, maximal clique and minimal degree of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal non-bipartite regular graphs of girth 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular \(K_n\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular graphs with given girth pair / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-bipartite graphs of girth 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cages—a survey / rank
 
Normal rank

Latest revision as of 11:24, 14 June 2024

scientific article; zbMATH DE number 3838061
Language Label Description Also known as
English
Extremal non-bipartite regular graphs of girth 4
scientific article; zbMATH DE number 3838061

    Statements