On Minimal Blocks
From MaRDI portal
Publication:5578807
DOI10.2307/1994828zbMath0187.21101OpenAlexW4241645828MaRDI QIDQ5578807
Publication date: 1968
Full work available at URL: https://doi.org/10.2307/1994828
Related Items (48)
Minimally 3-connected graphs ⋮ 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 ⋮ Maximum chromatic polynomial of 3-chromatic blocks ⋮ Wings and perfect graphs ⋮ 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 ⋮ Partial list colouring of certain graphs ⋮ Acyclic chromatic index of chordless graphs ⋮ On the spectral radius of minimally 2-(edge)-connected graphs with given size ⋮ Extremal critically connected matroids ⋮ On the \(\alpha\)-index of minimally 2-connected graphs with given order or size ⋮ Structural properties of minimal strong digraphs versus trees ⋮ The extremal spectral radius of generalized block graphs ⋮ Minimal strong digraphs ⋮ Uniformly 3‐connected graphs ⋮ On Connectivity in Matroids and Graphs ⋮ Characterization of minimally \((2,l)\)-connected graphs ⋮ Minimal biconnected graphs ⋮ Odd cycles and \(\Theta\)-cycles in hypergraphs ⋮ On the maximum number of diagonals of a circuit in a graph ⋮ Distance labeling scheme and split decomposition ⋮ Properties of unique realizations - a survey ⋮ Strongly unichord-free graphs ⋮ 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\) ⋮ Theta rank, levelness, and matroid minors ⋮ Unnamed Item ⋮ Using SPQR-trees to speed up recognition algorithms based on 2-cutsets ⋮ Strong Chromatic Index of 2-Degenerate Graphs ⋮ The diameter and radius of simple graphs ⋮ Über n-fach zusammenhängende Eckenmengen in Graphen ⋮ On minimal elementary bipartite graphs ⋮ Unnamed Item ⋮ The square of every two-connected graph is Hamiltonian ⋮ On minor-minimally-connected matroids ⋮ On `maximal' Hamiltonian cycles in the square of a block ⋮ Shortest coverings of graphs with cycles ⋮ Cycle covering in bridgeless graphs
Cites Work
This page was built for publication: On Minimal Blocks
