2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs (Q604983): Difference between revisions

@@ Property / DOI @@
-.1007/s00373-010-0932-y
@@ Property / DOI: 10.1007/s00373-010-0932-y / 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.1007/s00373-010-0932-y
+Normal rank
@@ Property / OpenAlex ID @@
+W1983059054
@@ Property / OpenAlex ID: W1983059054 / rank @@
+Normal rank
@@ Property / cites work @@
+On a theorem of Mader
@@ Property / cites work: On a theorem of Mader / rank @@
+Normal rank
@@ Property / cites work @@
+Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs
+Normal rank
@@ Property / cites work @@
+A Reduction Method for Edge-Connectivity in Graphs
+Normal rank
@@ Property / cites work @@
+Q4273849
@@ Property / cites work: Q4273849 / rank @@
+Normal rank
@@ Property / cites work @@
+-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs
+Normal rank
@@ Property / cites work @@
+Q5461466
@@ Property / cites work: Q5461466 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5463585
@@ Property / cites work: Q5463585 / rank @@
+Normal rank
@@ Property / cites work @@
+Two paths joining given vertices in \(2k\)-edge-connected graphs
+Normal rank
@@ Property / cites work @@
+-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs
+Normal rank
@@ Property / DOI @@
+.1007/S00373-010-0932-Y
@@ Property / DOI: 10.1007/S00373-010-0932-Y / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:604983