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

@@ Property / cites work @@
+On the Minimum Order of Extremal Graphs to have a Prescribed Girth
+Normal rank
@@ Property / cites work @@
+Q3624955
@@ Property / cites work: Q3624955 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4350166
@@ Property / cites work: Q4350166 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5725269
@@ Property / cites work: Q5725269 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximally connected digraphs
@@ Property / cites work: Maximally connected digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3490015
@@ Property / cites work: Q3490015 / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal graphs without three‐cycles or four‐cycles
+Normal rank
@@ Property / cites work @@
+Q4024328
@@ Property / cites work: Q4024328 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2716030
@@ Property / cites work: Q2716030 / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity of Regular Directed Graphs with Small Diameters
+Normal rank
@@ Property / cites work @@
+Q3880849
@@ Property / cites work: Q3880849 / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of extremal graphs of high girth
@@ Property / cites work: On the structure of extremal graphs of high girth / rank @@
+Normal rank
@@ Property / cites work @@
+Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
+Normal rank
@@ Property / cites work @@
+Cages—a survey
@@ Property / cites work: Cages—a survey / rank @@
+Normal rank