Making a \(C_6\)-free graph \(C_4\)-free and bipartite (Q298970): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2015.06.008
@@ Property / DOI: 10.1016/j.dam.2015.06.008 / rank @@
-Normal rank
@@ Property / author @@
-Ervin Gyoeri
@@ Property / author: Ervin Gyoeri / rank @@
-Normal rank
@@ Property / author @@
-Q340519
@@ Property / author: Q340519 / rank @@
-Normal rank
@@ Property / author @@
+Ervin Gyoeri
@@ Property / author: Ervin Gyoeri / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2015.06.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2336338640
@@ Property / OpenAlex ID: W2336338640 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Turán number for the hexagon
@@ Property / cites work: On the Turán number for the hexagon / rank @@
+Normal rank
@@ Property / cites work @@
+\(C_ 6\)-free bipartite graphs and product representation of squares
+Normal rank
@@ Property / cites work @@
+Four-cycles in graphs without a given even cycle
@@ Property / cites work: Four-cycles in graphs without a given even cycle / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2015.06.008
@@ Property / DOI: 10.1016/J.DAM.2015.06.008 / rank @@
+Normal rank