Neighborhood unions and disjoint chorded cycles in graphs (Q764874): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2011.10.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2023512741
@@ Property / OpenAlex ID: W2023512741 / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint cycles with chords in graphs
@@ Property / cites work: Disjoint cycles with chords in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint chorded cycles in graphs
@@ Property / cites work: Disjoint chorded cycles in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+On a sharp degree sum condition for disjoint chorded cycles in graphs
+Normal rank
@@ Property / cites work @@
+On the maximal number of independent circuits in a graph
+Normal rank
@@ Property / cites work @@
+On the existence of disjoint cycles in a graph
@@ Property / cites work: On the existence of disjoint cycles in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5492569
@@ Property / cites work: Q5492569 / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of independent chorded cycles in a graph
+Normal rank
@@ Property / cites work @@
+Q5342985
@@ Property / cites work: Q5342985 / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum number of independent cycles in a graph
+Normal rank