The following pages link to On Minimal Blocks (Q5578807):
Displaying 43 items.
- The tree of cuts and minimal \(k\)-connected graphs (Q291167) (← links)
- Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\) (Q291168) (← links)
- Using SPQR-trees to speed up algorithms based on 2-cutset decompositions (Q324769) (← links)
- On a conjecture on the balanced decomposition number (Q389207) (← links)
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Minimal strong digraphs (Q409422) (← links)
- Theta rank, levelness, and matroid minors (Q505908) (← links)
- On some extremal connectivity results for graphs and matroids (Q594104) (← links)
- Superfluous paths in strong digraphs (Q594892) (← links)
- On minor-minimally-connected matroids (Q798327) (← links)
- Shortest coverings of graphs with cycles (Q802571) (← links)
- Partial list colouring of certain graphs (Q888600) (← links)
- Minimal biconnected graphs (Q906762) (← links)
- Cycle covering in bridgeless graphs (Q1069955) (← links)
- Minimally 3-connected graphs (Q1080868) (← links)
- Wings and perfect graphs (Q1112849) (← links)
- On the maximum number of diagonals of a circuit in a graph (Q1156149) (← links)
- Properties of unique realizations - a survey (Q1161530) (← links)
- The diameter and radius of simple graphs (Q1212018) (← links)
- Über n-fach zusammenhängende Eckenmengen in Graphen (Q1222660) (← links)
- On minimal elementary bipartite graphs (Q1245978) (← links)
- On `maximal' Hamiltonian cycles in the square of a block (Q1309471) (← links)
- The structure of quasi 4-connected graphs (Q1356425) (← links)
- Maximum chromatic polynomial of 3-chromatic blocks (Q1366786) (← links)
- On the average Steiner distance of graphs with presribed properties (Q1372733) (← links)
- Extremal critically connected matroids (Q1394352) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- Structural properties of minimal strong digraphs versus trees (Q1688914) (← links)
- Strongly unichord-free graphs (Q1717190) (← links)
- Using SPQR-trees to speed up recognition algorithms based on 2-cutsets (Q1752488) (← links)
- Characterization of minimally \((2,l)\)-connected graphs (Q1944218) (← links)
- The maximum average connectivity among all orientations of a graph (Q2125229) (← links)
- Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size (Q2158294) (← links)
- Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size (Q2166257) (← links)
- Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs (Q2217476) (← links)
- On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\) (Q2235269) (← links)
- Odd cycles and \(\Theta\)-cycles in hypergraphs (Q2433709) (← links)
- The square of every two-connected graph is Hamiltonian (Q2558870) (← links)
- Strong Chromatic Index of 2-Degenerate Graphs (Q4920654) (← links)
- Acyclic chromatic index of chordless graphs (Q6041561) (← links)
- On the \(\alpha\)-index of minimally 2-connected graphs with given order or size (Q6064860) (← links)
- The extremal spectral radius of generalized block graphs (Q6087876) (← links)
- Uniformly 3‐connected graphs (Q6144917) (← links)
