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

@@ Property / DOI @@
-.1016/j.disc.2007.10.037
@@ Property / DOI: 10.1016/j.disc.2007.10.037 / rank @@
-Normal rank
@@ Property / author @@
-Camino Balbuena
@@ Property / author: Camino Balbuena / rank @@
-Normal rank
@@ Property / author @@
-Martín Cera
@@ Property / author: Martín Cera / rank @@
-Normal rank
@@ Property / author @@
-Pedro García-Vázquez
@@ Property / author: Pedro García-Vázquez / rank @@
-Normal rank
@@ Property / author @@
+Camino Balbuena
@@ Property / author: Camino Balbuena / rank @@
+Normal rank
@@ Property / author @@
+Martín Cera
@@ Property / author: Martín Cera / rank @@
+Normal rank
@@ Property / author @@
+Pedro García-Vázquez
@@ Property / author: Pedro García-Vázquez / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2007.10.037
+Normal rank
@@ Property / OpenAlex ID @@
+W1978339393
@@ Property / OpenAlex ID: W1978339393 / rank @@
+Normal rank
@@ 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
@@ Property / DOI @@
+.1016/J.DISC.2007.10.037
@@ Property / DOI: 10.1016/J.DISC.2007.10.037 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:998448