A bound on the total size of a cut cover (Q2484376): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2005.04.003
@@ Property / DOI: 10.1016/j.disc.2005.04.003 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2005.04.003
+Normal rank
@@ Property / OpenAlex ID @@
+W1980860919
@@ Property / OpenAlex ID: W1980860919 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering Multigraphs by Simple Circuits
@@ Property / cites work: Covering Multigraphs by Simple Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with the Circuit Cover Property
@@ Property / cites work: Graphs with the Circuit Cover Property / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest coverings of graphs with cycles
@@ Property / cites work: Shortest coverings of graphs with cycles / rank @@
+Normal rank
@@ Property / cites work @@
+On the Decomposition of Graphs
@@ Property / cites work: On the Decomposition of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Representation of a Graph by Set Intersections
+Normal rank
@@ Property / cites work @@
+Covering Graphs by Cycles
@@ Property / cites work: Covering Graphs by Cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Q4344209
@@ Property / cites work: Q4344209 / rank @@
+Normal rank
@@ Property / cites work @@
+Proofs of two minimum circuit cover conjectures
@@ Property / cites work: Proofs of two minimum circuit cover conjectures / rank @@
+Normal rank
@@ Property / cites work @@
+Cycle covering in bridgeless graphs
@@ Property / cites work: Cycle covering in bridgeless graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Covering a graph with cuts of minimum total size
@@ Property / cites work: Covering a graph with cuts of minimum total size / rank @@
+Normal rank
@@ Property / cites work @@
+On a problem of G. O. H. Katona and T. Tarján
@@ Property / cites work: On a problem of G. O. H. Katona and T. Tarján / rank @@
+Normal rank
@@ Property / cites work @@
+Covering Graphs by Simple Circuits
@@ Property / cites work: Covering Graphs by Simple Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q4166786
@@ Property / cites work: Q4166786 / rank @@
+Normal rank
@@ Property / cites work @@
+On shortest cocycle covers of graphs
@@ Property / cites work: On shortest cocycle covers of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Short cycle covers and the cycle double cover conjecture
+Normal rank
@@ Property / cites work @@
+Proof of a conjecture of Katona and Tarjan
@@ Property / cites work: Proof of a conjecture of Katona and Tarjan / rank @@
+Normal rank
@@ Property / cites work @@
+On embedding complete graphs into hypercubes
@@ Property / cites work: On embedding complete graphs into hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4242950
@@ Property / cites work: Q4242950 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3137210
@@ Property / cites work: Q3137210 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3916595
@@ Property / cites work: Q3916595 / rank @@
+Normal rank
@@ Property / cites work @@
+Polyhedral decompositions of cubic graphs
@@ Property / cites work: Polyhedral decompositions of cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Finding a Minimum Cycle Cover of a Graph
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2005.04.003
@@ Property / DOI: 10.1016/J.DISC.2005.04.003 / rank @@
+Normal rank