The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs (Q3439419): Difference between revisions

@@ 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.endm.2006.06.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2116073802
@@ Property / OpenAlex ID: W2116073802 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q123010426
@@ Property / Wikidata QID: Q123010426 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3832607
@@ Property / cites work: Q3832607 / rank @@
+Normal rank
@@ Property / cites work @@
+A note about the dominating circuit conjecture
@@ Property / cites work: A note about the dominating circuit conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalence of Fleischner's and Thomassen's conjectures
+Normal rank
@@ Property / cites work @@
+Recharacterizing Eulerian: Intimations of new duality
+Normal rank
@@ Property / cites work @@
+On a closure concept in claw-free graphs
@@ Property / cites work: On a closure concept in claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Reflections on graph theory
@@ Property / cites work: Reflections on graph theory / rank @@
+Normal rank