Connectivity keeping trees in k-connected graphs (Q2891042): 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.1002/jgt.20585
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20585 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1989205613
@@ Property / OpenAlex ID: W1989205613 / rank @@
+Normal rank
@@ Property / cites work @@
+Critically n-Connected Graphs
@@ Property / cites work: Critically n-Connected Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Non-separating trees in connected graphs
@@ Property / cites work: Non-separating trees in connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity keeping edges in graphs with large minimum degree
+Normal rank
@@ Property / cites work @@
+On critically connected digraphs
@@ Property / cites work: On critically connected digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Vertices of small degree in critically \(n\)-connected digraphs
+Normal rank
@@ Property / cites work @@
+Connectivity keeping paths in k-connected graphs
@@ Property / cites work: Connectivity keeping paths in k-connected graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2891042