Disjoint chorded cycles in graphs (Q998485): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1016/j.disc.2007.10.040
-Normal rank
@@ Property / OpenAlex ID @@
-W2001686801
@@ Property / OpenAlex ID: W2001686801 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2007.10.040
+Normal rank
@@ Property / OpenAlex ID @@
+W2001686801
@@ Property / OpenAlex ID: W2001686801 / rank @@
+Normal rank
@@ Property / cites work @@
+On independent cycles and edges in graphs
@@ Property / cites work: On independent cycles and edges in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4842721
@@ Property / cites work: Q4842721 / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximal number of independent circuits in a graph
+Normal rank
@@ Property / cites work @@
+Q3826605
@@ Property / cites work: Q3826605 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4276003
@@ Property / cites work: Q4276003 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5342985
@@ Property / cites work: Q5342985 / rank @@
+Normal rank