On Minimal Blocks - MaRDI portal

Cited in

(53)

Cycle covering in bridgeless graphs
Minimally 3-connected graphs
Wings and perfect graphs
On the maximum number of diagonals of a circuit in a graph
Properties of unique realizations - a survey
The diameter and radius of simple graphs
Über n-fach zusammenhängende Eckenmengen in Graphen
On minimal elementary bipartite graphs
On `maximal' Hamiltonian cycles in the square of a block
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
Distance labeling scheme and split decomposition
Structural properties of minimal strong digraphs versus trees
Strongly unichord-free graphs
Using SPQR-trees to speed up recognition algorithms based on 2-cutsets
Characterization of minimally (2,l)-connected graphs
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\)
Odd cycles and \(\Theta\)-cycles in hypergraphs
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
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?)
Strong chromatic index of 2-degenerate graphs
Theta rank, levelness, and matroid minors
Contractible and non-contractible non-edges in 2-connected graphs
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
On the \(\alpha\)-index of minimally 2-connected graphs with given order or size
The extremal spectral radius of generalized block graphs
Uniformly 3‐connected graphs
Upper bounds on the second largest Laplacian eigenvalue of graphs with given size
Sharp upper bounds on the second largest signless Laplacian eigenvalues of connected graphs
A max-min problem on spectral radius and connectedness of graphs
A synthesis for uniformly 3-edge-connected 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
Partial list colouring of certain graphs
Minimal biconnected graphs

This page was built for publication: On Minimal Blocks

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