Minimally 2-connected graphs.

Cited in

(79)

Minimally 3-connected graphs
On the decomposition of a minimally strongly h-connected digraph into h+1 acircuitic subgraphs
On the maximum number of diagonals of a circuit in a graph
Reducible chains in several types of 2-connected graphs
Über n-fach zusammenhängende Eckenmengen in Graphen
The entire graph of a bridgeless connected plane graph is Hamiltonian
In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
On minimal elementary bipartite graphs
The structure of quasi 4-connected graphs
Maximum chromatic polynomial of 3-chromatic blocks
On the average Steiner distance of graphs with presribed properties
Extremal critically connected matroids
On packing minors into connected matroids
Structural properties of minimal strong digraphs versus trees
Strongly unichord-free graphs
Using SPQR-trees to speed up recognition algorithms based on 2-cutsets
On the minor-minimal 2-connected graphs having a fixed minor
The square of a block is strongly path connected
Elements belonging to triads in 3-connected matroids
Characterization of minimally (2,l)-connected graphs
Cut and pendant vertices and the number of connected induced subgraphs of a graph
The maximum average connectivity among all orientations of a graph
Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size
Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs
On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
On minimally 2-(edge)-connected graphs with extremal spectral radius
Odd cycles and \(\Theta\)-cycles in hypergraphs
Removable edges in a spanning tree of a k-connected graph
Removable edges in a 5-connected graph and a construction method of 5-connected graphs
Zur Theorie der n-fach zusammenhängenden Graphen
Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen
Kreise beschränkter Länge in gewissen minimalen n-fach zusammenhängenden Graphen
Ecken n-ten Grades in minimalen n-fach zusammenhängenden Graphen
Unendliche minimale \(n\)-fach zusammenhängende Graphen
Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen
Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
The square of every two-connected graph is Hamiltonian
The tree of cuts and minimal \(k\)-connected graphs
Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)
Using SPQR-trees to speed up algorithms based on 2-cutset decompositions
Extremal \(H\)-colorings of trees and 2-connected graphs
On a conjecture on the balanced decomposition number
Edge-colouring and total-colouring chordless graphs
On Connectivity in Matroids and Graphs
scientific article; zbMATH DE number 3773633 (Why is no real title available?)
Minimal strong digraphs
scientific article; zbMATH DE number 3544091 (Why is no real title available?)
The bottleneck 2-connected k-Steiner network problem for k 2
Plane triangulations without a spanning Halin subgraph. II
Computing minimum 2-edge-connected Steiner networks in the Euclidean plane
Strong chromatic index of 2-degenerate graphs
Theta rank, levelness, and matroid minors
Contractible and non-contractible non-edges in 2-connected graphs
Removable edges in cycles of a k-connected graph
Graph theory
On some extremal connectivity results for graphs and matroids
Superfluous paths in strong digraphs
Acyclic chromatic index of chordless graphs
On the spectral radius of minimally 2-(edge)-connected graphs with given size
Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
On the \(\alpha\)-index of minimally 2-connected graphs with given order or size
Fixed parameter tractability of a biconnected bottleneck Steiner network problem
Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size
Uniformly connected graphs
The extremal spectral radius of generalized block graphs
Uniformly 3‐connected graphs
Ear‐decompositions, minimally connected matroids and rigid graphs
The proper 2-connection number of several graph classes
On vertex peripherians and Wiener index of graphs with fixed number of cut vertices
Upper bounds on the second largest Laplacian eigenvalue of graphs with given size
A characterization of minimally connected graphs without 2-clique cutsets
Sharp upper bounds on the second largest signless Laplacian eigenvalues of connected graphs
A max-min problem on spectral radius and connectedness of graphs
Maximizing the spectral radius of minimally connected graphs with size m and no 2-clique cutsets
On minor-minimally-connected matroids
Shortest coverings of graphs with cycles
Minimal biconnected graphs
An exact algorithm for the bottleneck 2-connected k-Steiner network problem in L_p planes

This page was built for publication: Minimally 2-connected graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5534024)