A note on disjoint cycles (Q413261): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2011.11.006
@@ Property / DOI: 10.1016/j.ipl.2011.11.006 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6030948
@@ Property / zbMATH DE Number: 6030948 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial problems
@@ Property / zbMATH Keywords: combinatorial problems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+vertex-disjoint cycles
@@ Property / zbMATH Keywords: vertex-disjoint cycles / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+maximum genus
@@ Property / zbMATH Keywords: maximum genus / 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.ipl.2011.11.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2088478548
@@ Property / OpenAlex ID: W2088478548 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4694737
@@ Property / cites work: Q4694737 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414505
@@ Property / cites work: Q4414505 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing cycles in undirected graphs
@@ Property / cites work: Packing cycles in undirected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms and hardness results for cycle packing problems
+Normal rank
@@ Property / cites work @@
+Approximability of packing disjoint cycles
@@ Property / cites work: Approximability of packing disjoint cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Q5342984
@@ Property / cites work: Q5342984 / rank @@
+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 @@
+Q5530472
@@ Property / cites work: Q5530472 / rank @@
+Normal rank
@@ Property / cites work @@
+How to determine the maximum genus of a graph
@@ Property / cites work: How to determine the maximum genus of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum genus of a graph
@@ Property / cites work: On the maximum genus of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings
+Normal rank
@@ Property / cites work @@
+Characterization of the maximum genus of a signed graph
+Normal rank
@@ Property / cites work @@
+A Characterization in of Upper-Embeddable Graphs
@@ Property / cites work: A Characterization in of Upper-Embeddable Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4277394
@@ Property / cites work: Q4277394 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3757929
@@ Property / cites work: Q3757929 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank
@@ Property / cites work @@
+A Kuratowski-type theorem for the maximum genus of a graph
+Normal rank
@@ Property / cites work @@
+Q5284654
@@ Property / cites work: Q5284654 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2011.11.006
@@ Property / DOI: 10.1016/J.IPL.2011.11.006 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:413261