scientific article; zbMATH DE number 3166039
From MaRDI portal
Publication:3284374
Cited in
(only showing first 100 items - show all)- Structure and enumeration of two-connected graphs with prescribed three-connected components
- Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs
- A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs
- Minimally 3-connected graphs
- Contractible edges in 3-connected graphs
- The number of contractible edges in 3-connected graphs
- Generalizaions of critical connectivity of graphs
- Planarity and duality of finite and infinite graphs
- Non-separating induced cycles in graphs
- A characterization of 3-connected graphs containing a given graph
- Indestructive deletions of edges from graphs
- Triangles in 3-connected matroids
- On minimal neighbourhood-connected graphs
- On 3-connected graphs with contractible edge covers of size \(k\)
- A construction of 3-connected graphs
- Contractible edges in longest cycles in non-Hamiltonian graphs
- Enumeration of 2-connected loopless 4-regular maps on the plane
- The structure of quasi 4-connected graphs
- A longest cycle version of Tutte's wheels theorem
- On contractible and vertically contractible elements in 3-connected matroids and graphs
- Splitting and contractible edges in 4-connected graphs
- Vertices of degree 6 in a contraction critically 6-connected graph
- Contractible non-edges in \(3\)-connected graphs
- On the structure of 3-connected matroids and graphs
- Contractible circuits in \(3\)-connected graphs
- On the critical densities of minor-closed classes
- Non-contractible non-edges in 2-connected graphs
- Trivially noncontractible edges in a contraction critically 5-connected graph
- Generating closed 2-cell embeddings in the torus and the projective plane
- Contractible subgraphs in 3-connected graphs
- Almost all 3-connected graphs contain a contractible set of \(k\) vertices
- Generating internally four-connected graphs
- Determination of the bases of a splitting matroid
- The number of removable edges in a 4-connected graph
- Minor-minimal 6-regular graphs in the Klein bottle
- Upper bounds for the forwarding indices of communication networks
- Non-contractible edges in a 3-connected graph
- On fixing edges in graph minors
- Generating the centrally symmetric 3-polyhedral graphs
- A remark on the connectivity of the complement of a 3-connected graph
- The structure of a decomposition of a triconnected graph
- On local structure of 9- and 10-connected graphs
- On vertices of degree \(k\) of minimal and contraction critical \(k\)-connected graphs: upper bounds
- Some results involving the splitting operation on binary matroids
- Graphs with no \(K_{3,3}\) minor containing a fixed edge
- The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs
- The contributions of W.T. Tutte to matroid theory
- On vertices of degree 6 of minimal and contraction critical 6-connected graph
- Contractible edges in \(k\)-connected graphs with minimum degree greater than or equal to \(\lfloor \frac{ 3 k - 1}{ 2} \rfloor \)
- Minor obstructions for apex-pseudoforests
- Contractible edges and contractible triangles in a 3-connected graph
- On highly regular strongly regular graphs
- Strengthened chain theorems for different versions of 4-connectivity
- A constructive characterization of 4-connected graphs
- On polyhedral graphs and their complements
- Chromatic number, induced cycles, and non-separating cycles
- Local structure of 5- and 6-connected graphs
- Local structure of 7- and 8-connected graphs
- The number of vertices of degree 5 in a contraction-critically 5-connected graph
- Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions
- Contractible edges and removable edges in 3-connected graphs
- A constructive characterization of contraction critical 8-connected graphs with minimum degree 9
- Contractible and removable edges in 3-connected infinite graphs
- Contractible edges in a 4-connected graph with vertices of degree greater than four
- Signed-graphic matroids with all-graphic cocircuits
- Characterizing graphs of maximum matching width at most 2
- Construction sequences and certifying 3-connectivity
- An O(n+m) certifying triconnnectivity algorithm for Hamiltonian graphs
- Removable edges in a spanning tree of a k-connected graph
- On small contractible subgraphs in 3-connected graphs of small average degree
- On the number of contractible triples in 3-connected graphs
- Contractible edges in minimally \(k\)-connected graphs
- Removable edges in a 5-connected graph and a construction method of 5-connected graphs
- A new degree sum condition for the existence of a contractible edge in a -connected graph
- Contractible edges in 7-connected graphs
- An extremal problem on contractible edges in 3-connected graphs
- Counting \(K_4\)-subdivisions
- Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
- Zur Theorie der n-fach zusammenhängenden Graphen
- Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen
- An algorithm for straight-line representation of simple planar graphs
- Generating planar 4-connected graphs
- Thickness and coarseness of graphs
- High connectivity keeping sets in graphs and digraphs
- Generation of simple quadrangulations of the sphere
- Generating bricks
- On strict brambles
- Contractible edges and longest cycles in 3-connected graphs
- Properly 3-contractible edges in a minimally 3-connected graph
- On smallest 3-polytopes of given graph radius
- Local convergence of random planar graphs
- On the structure of contractible vertex pairs in chordal graphs
- Deleting vertices from a 2-connected graph with preserving 2-connectedness
- On the structure of \(C_3\)-critical minimal 6-connected graphs
- The excluded minors for isometric realizability in the plane
- Facial rainbow edge-coloring of simple 3-connected plane graphs
- 4-edge-connected 4-regular maps on the projective plane
- Vertices of degree 6 in a 6-contraction critical graph
- Nonseparating cycles avoiding specific vertices
- A local structure theorem on 5-connected graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3284374)