Minimally 2-connected graphs.
From MaRDI portal
Publication:5534024
DOI10.1515/crll.1967.228.204zbMath0153.25804OpenAlexW171464046MaRDI QIDQ5534024
Publication date: 1967
Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)
Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN002182661
Related Items (72)
Minimally 3-connected graphs ⋮ Elements belonging to triads in 3-connected matroids ⋮ The maximum average connectivity among all orientations of a graph ⋮ The tree of cuts and minimal \(k\)-connected graphs ⋮ Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\) ⋮ Unnamed Item ⋮ Using SPQR-trees to speed up algorithms based on 2-cutset decompositions ⋮ The structure of quasi 4-connected graphs ⋮ Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size ⋮ Extremal \(H\)-colorings of trees and 2-connected graphs ⋮ Maximum chromatic polynomial of 3-chromatic blocks ⋮ Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size ⋮ On some extremal connectivity results for graphs and matroids ⋮ On the average Steiner distance of graphs with presribed properties ⋮ Superfluous paths in strong digraphs ⋮ On a conjecture on the balanced decomposition number ⋮ Edge-colouring and total-colouring chordless graphs ⋮ Plane Triangulations Without a Spanning Halin Subgraph II ⋮ 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 ⋮ Extremal critically connected matroids ⋮ 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 ⋮ Structural properties of minimal strong digraphs versus trees ⋮ On the decomposition of a minimally strongly h-connected digraph into h+1 acircuitic subgraphs ⋮ Uniformly connected graphs ⋮ On minimally 2-(edge)-connected graphs with extremal spectral radius ⋮ The extremal spectral radius of generalized block graphs ⋮ Minimal strong digraphs ⋮ Uniformly 3‐connected graphs ⋮ Ear‐decompositions, minimally connected matroids and rigid graphs ⋮ On Connectivity in Matroids and Graphs ⋮ Characterization of minimally \((2,l)\)-connected graphs ⋮ The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) ⋮ Minimal biconnected graphs ⋮ Odd cycles and \(\Theta\)-cycles in hypergraphs ⋮ An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes ⋮ On the maximum number of diagonals of a circuit in a graph ⋮ Removable edges in a spanning tree of a \(k\)-connected graph ⋮ Strongly unichord-free graphs ⋮ Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs ⋮ Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane ⋮ On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\) ⋮ Theta rank, levelness, and matroid minors ⋮ Unnamed Item ⋮ Using SPQR-trees to speed up recognition algorithms based on 2-cutsets ⋮ Reducible chains in several types of 2-connected graphs ⋮ Removable edges in a 5-connected graph and a construction method of 5-connected graphs ⋮ Strong Chromatic Index of 2-Degenerate Graphs ⋮ Removable edges in cycles of a \(k\)-connected graph ⋮ Ü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 ⋮ Graph theory ⋮ On minimal elementary bipartite graphs ⋮ Cut and pendant vertices and the number of connected induced subgraphs of a graph ⋮ Unnamed Item ⋮ 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) ⋮ On the minor-minimal 2-connected graphs having a fixed minor ⋮ The square of every two-connected graph is Hamiltonian ⋮ On packing minors into connected matroids ⋮ The square of a block is strongly path connected ⋮ On minor-minimally-connected matroids ⋮ Shortest coverings of graphs with cycles
This page was built for publication: Minimally 2-connected graphs.
