Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
From MaRDI portal
Publication:2544590
DOI10.1007/BF01304873zbMath0212.29402MaRDI QIDQ2544590
Publication date: 1972
Published in: Archiv der Mathematik (Search for Journal in Brave)
Related Items
Minimally 3-connected graphs, Elements belonging to triads in 3-connected matroids, The maximum average connectivity among all orientations of a graph, Path-connectivity in graphs, The tree of cuts and minimal \(k\)-connected graphs, Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\), On the structure of \(C_3\)-critical minimal 6-connected graphs, On Vertices of outdegree n in minimally n‐connected digraphs, \(k\)-connectivity and decomposition of graphs into forests, Minimum 2-vertex strongly biconnected spanning directed subgraph problem, Approximating \(k\)-connected \(m\)-dominating sets, Note on vertex and total proper connection numbers, Generalizaions of critical connectivity of graphs, On 3-connected matroids, On the existence of \((k,l)\)-critical graphs, Power optimization for connectivity problems, On Vertex-Edge-Critically n-Connected Graphs, The symmetric (2k, k)-graphs, Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design, Connectivity preserving trees in k‐connected or k‐edge‐connected graphs, Radically solvable graphs, Uniformly 3‐connected graphs, On extremal \(k\)-outconnected graphs, On Connectivity in Matroids and Graphs, Elements belonging to triangles in 3-connected matroids, Quelques problèmes de connexite dans les graphes orientes, Indestructive deletions of edges from graphs, Edge reductions in cyclically \(k\)-connected cubic graphs, Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs, Small \(\ell\)-edge-covers in \(k\)-connected graphs, Minimally contraction-critically 6-connected graphs, Approximating k-Connected m-Dominating Sets, A \(4+\epsilon\) approximation for \(k\)-connected subgraphs, The number of elements belonging to triads in 3-connected binary matroids, Contractible edges in minimally \(k\)-connected graphs, A minimal 3-connectedness result for matroids, The Average Degree of Minimally Contraction‐Critically 5‐Connected Graphs, Local structure of 5- and 6-connected graphs, Local structure of 7- and 8-connected graphs, Some structural properties of minimally contraction-critically 5-connected graphs, Locally finite graphs with ends: A topological approach. II: Applications, Über n-fach zusammenhängende Eckenmengen in Graphen, 2-node-connectivity network design, Independence free graphs and vertex connectivity augmentation, Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs, Extremal infinite graph theory, On vertices of degree 6 of minimal and contraction critical 6-connected graph, Extremal graphs in connectivity augmentation, A tight bound on the collection of edges in MSTs of induced subgraphs, The number of 1-factors in 2k-connected graphs, Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems, On k-minimally n-edge-connected graphs, Approximating minimum-power edge-covers and 2,3-connectivity, Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem), On the maximum size of a minimal \(k\)-edge connected augmentation, Unnamed Item, Approximation algorithms for vertex-connectivity augmentation on the cycle, Minimally k-connected graphs of low order and maximal size, High connectivity keeping sets in graphs and digraphs, On minimally \((n,\lambda)\)-connected graphs, Contractible edges and triangles in \(k\)-connected graphs, From edge-coloring to strong edge-coloring, Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs), Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
Cites Work
