The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\) (Q1569066): 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.1006/jctb.1999.1929
+Normal rank
@@ Property / OpenAlex ID @@
+W2090651681
@@ Property / OpenAlex ID: W2090651681 / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on k-Critically n-Connected Graphs
@@ Property / cites work: A Note on k-Critically n-Connected Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the existence of \((k,l)\)-critical graphs
@@ Property / cites work: On the existence of \((k,l)\)-critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On \(k\)-critical connected line graphs
@@ Property / cites work: On \(k\)-critical connected line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds to the number of vertices in a \(k\)-critically \(n\)-connected graph
+Normal rank
@@ Property / cites work @@
+Q3220626
@@ Property / cites work: Q3220626 / rank @@
+Normal rank
@@ Property / cites work @@
+Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
+Normal rank
@@ Property / cites work @@
+Generalizaions of critical connectivity of graphs
@@ Property / cites work: Generalizaions of critical connectivity of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On k-critical, n-connected graphs
@@ Property / cites work: On k-critical, n-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Domination-balanced graphs
@@ Property / cites work: Domination-balanced graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On locally \(k\)-critically \(n\)-connected graphs
+Normal rank
@@ Property / cites work @@
+Fragments in 2-critically \(n\)-connected graphs
@@ Property / cites work: Fragments in 2-critically \(n\)-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fragments in <i>k</i>critical <i>n</i>‐connected graphs
+Normal rank