Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen
From MaRDI portal
(Redirected from Publication:2544590)
Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
Cites work
Cited in
(68)- Extremal graphs in connectivity augmentation
- Contractible edges and triangles in k-connected graphs
- Power optimization for connectivity problems
- The number of 1-factors in 2k-connected graphs
- On Connectivity in Matroids and Graphs
- Elements belonging to triads in 3-connected matroids
- Quelques problèmes de connexite dans les graphes orientes
- Approximating \(k\)-connected \(m\)-dominating sets
- Data structures for node connectivity queries
- Uniformly 3‐connected graphs
- On minimally \((n,\lambda)\)-connected graphs
- Approximation algorithms for vertex-connectivity augmentation on the cycle
- Contractible edges in minimally \(k\)-connected graphs
- Minimum 2-vertex strongly biconnected spanning directed subgraph problem
- 2-node-connectivity network design
- A synthesis for uniformly 3-edge-connected graphs
- Elements belonging to triangles in 3-connected matroids
- Minimally 3-connected graphs
- Über n-fach zusammenhängende Eckenmengen in Graphen
- Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs
- The maximum average connectivity among all orientations of a graph
- Indestructive deletions of edges from graphs
- From edge-coloring to strong edge-coloring
- A 4+ approximation for k-connected subgraphs
- Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)
- On the structure of \(C_3\)-critical minimal 6-connected graphs
- The tree of cuts and minimal \(k\)-connected graphs
- On Vertices of outdegree n in minimally n‐connected digraphs
- Edge reductions in cyclically \(k\)-connected cubic graphs
- Some structural properties of minimally contraction-critically 5-connected graphs
- Small \(\ell\)-edge-covers in \(k\)-connected graphs
- Graphs without a 3-connected subgraph are 4-colourable
- Minimally contraction-critically 6-connected graphs
- On the existence of (k,l)-critical graphs
- A tight bound on the collection of edges in MSTs of induced subgraphs
- On 3-connected matroids
- On Vertex-Edge-Critically n-Connected Graphs
- Local structure of 5- and 6-connected graphs
- \(k\)-connectivity and decomposition of graphs into forests
- Independence free graphs and vertex connectivity augmentation
- Generalizaions of critical connectivity of graphs
- On k-minimally n-edge-connected graphs
- Note on vertex and total proper connection numbers
- Ü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
- Extremal infinite graph theory
- Locally finite graphs with ends: A topological approach. II: Applications
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems
- On vertices of degree 6 of minimal and contraction critical 6-connected graph
- scientific article; zbMATH DE number 2230263 (Why is no real title available?)
- High connectivity keeping sets in graphs and digraphs
- Local structure of 7- and 8-connected graphs
- Path-connectivity in graphs
- Minimally k-connected graphs of low order and maximal size
- The number of elements belonging to triads in 3-connected binary matroids
- Approximating k-Connected m-Dominating Sets
- Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
- Maximal spectral radius of minimally k-(edge)-connected graphs
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- The average degree of minimally contraction-critically 5-connected graphs
- A minimal 3-connectedness result for matroids
- Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
- Approximating minimum-power edge-covers and 2,3-connectivity
- Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
- Radically solvable graphs
- The symmetric (2k, k)-graphs
- Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
- On extremal \(k\)-outconnected graphs
This page was built for publication: Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2544590)
