scientific article
From MaRDI portal
Publication:3284374
zbMath0101.40903MaRDI QIDQ3284374
Publication date: 1961
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Whitney Connectivity of Matroids, Minimal locally cyclic triangulations of the projective plane, The 3‐connected graphs with a maximum matching containing precisely one contractible edge, On Random Representable Matroids, Generating bricks, Nonseparating Cycles Avoiding Specific Vertices, $K_5^-$-Subdivision in 4-Connected Graphs, Polytopes, graphs, and complexes, Contractible Edges in 3-Connected Cubic Graphs, On extremal graphs containing no wheels, Almost all rooted maps have large representativity, Lowest Order Squared Rectangles and Squares With the Largest Element Not on the Boundary, Plane Triangulations Without a Spanning Halin Subgraph II, On the spectral radius of minimally 2-(edge)-connected graphs with given size, Wheels in planar graphs and Hajós graphs, Contractible edges in longest cycles, The structure of graphs with no W4 immersion, Uniformly connected graphs, A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors, Uniformly 3‐connected graphs, On strict brambles, Contractible edges and longest cycles in 3-connected graphs, On unigraphic polyhedra with one vertex of degree \({p-2}\), Properly 3-contractible edges in a minimally 3-connected graph, On smallest 3-polytopes of given graph radius, Unnamed Item, Prime vertex-minors of a prime graph, Local convergence of random planar graphs, The Excluded Minors for Isometric Realizability in the Plane, The number of polyhedral (3-connected planar) graphs, Facial rainbow edge-coloring of simple 3-connected plane graphs, 4-edge-connected 4-regular maps on the projective plane, 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, Strongly involutive self-dual polyhedra, Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge, The contractible subgraph of 5-connected graphs, Unnamed Item, Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph, Removable edges in a 5-connected graph and a construction method of 5-connected graphs, Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph, The Average Degree of Minimally Contraction‐Critically 5‐Connected Graphs, A new degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph, Contractible edges in 7-connected graphs, An extremal problem on contractible edges in 3-connected graphs, A local structure theorem on 5-connected graphs, Recursive Generation of 5-Regular Planar 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, Unnamed Item, Unnamed Item, The Closure Operator of es-Splitting Matroids, On the Structure of Contractible Vertex Pairs in Chordal Graphs, Generating planar 4-connected graphs, Thickness and coarseness of graphs, Generating Nonisomorphic Maps without Storing Them, High connectivity keeping sets in graphs and digraphs, Cycle decompositions and constructive characterizations, Generation of simple quadrangulations of the sphere, Vertices of degree 6 in a 6-contraction critical graph, A construction of 3-connected graphs, Minimally 3-connected graphs, On the critical densities of minor-closed classes, The number of removable edges in a 4-connected graph, Contractible edges in longest cycles in non-Hamiltonian graphs, Minor-minimal 6-regular graphs in the Klein bottle, Deleting vertices from a 2-connected graph with preserving 2-connectedness, On the structure of \(C_3\)-critical minimal 6-connected graphs, Contractible edges in 3-connected graphs, Upper bounds for the forwarding indices of communication networks, Contractible edges in a 4-connected graph with vertices of degree greater than four, On the structure of contractible edges in \(k\)-connected partial \(k\)-trees, Enumeration of 2-connected loopless 4-regular maps on the plane, The structure of quasi 4-connected graphs, Non-contractible edges in a 3-connected graph, Contractible cliques in \(k\)-connected graphs, A constructive characterization of 4-connected graphs, The number of contractible edges in 3-connected graphs, Graphs of polyhedra; polyhedra as graphs, How to contract an essentially 6-connected graph to a 5-connected graph, On fixing edges in graph minors, A longest cycle version of Tutte's wheels theorem, Generalizaions of critical connectivity of graphs, On some extremal connectivity results for graphs and matroids, Generating the centrally symmetric 3-polyhedral graphs, A remark on the connectivity of the complement of a 3-connected graph, Signed-graphic matroids with all-graphic cocircuits, On contractible and vertically contractible elements in 3-connected matroids and graphs, On polyhedral graphs and their complements, A constructive characterization of 3-connected triangle-free graphs, The 3-connected graphs with exactly \(k\) non-essential edges, Non-contractible non-edges in 2-connected graphs, Contractions of 6-connected toroidal graphs, Characterizing graphs of maximum matching width at most 2, 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, Counting 2-connected 4-regular maps on the projective plane, Some results involving the splitting operation on binary matroids, Planarity and duality of finite and infinite graphs, Splitting and contractible edges in 4-connected graphs, Construction sequences and certifying 3-connectivity, An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs, Non-separating induced cycles in graphs, The decomposition tree of a biconnected graph, Minimal biconnected graphs, A characterization of 3-connected graphs containing a given graph, On removable edges in 3-connected cubic graphs, Graphs with no \(K_{3,3}\) minor containing a fixed edge, Removable edges in a spanning tree of a \(k\)-connected graph, Vertices of degree 6 in a contraction critically 6-connected graph, Indestructive deletions of edges from graphs, The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs, Minimally contraction-critically 6-connected graphs, Chromatic number, induced cycles, and non-separating cycles, Triangles in 3-connected matroids, The removable edges and the contractible subgraphs of 5-connected graphs, On minimal neighbourhood-connected graphs, Measures of edge-uncolorability of cubic graphs, Contractible edges in 2-connected locally finite graphs, Some degree and forbidden subgraph conditions for a graph to have a \(k\)-contractible edge, A characterization of some graph classes using excluded minors, On 3-connected graphs with contractible edge covers of size \(k\), Decomposition of 3-connected cubic graphs, Tutte polynomials computable in polynomial time, Planar graphs with no 6-wheel minor, The contributions of W.T. Tutte to matroid theory, Forbidden-minors for graphic and cographic es-splitting matroids, Local structure of 5- and 6-connected graphs, Local structure of 7- and 8-connected graphs, Some structural properties of minimally contraction-critically 5-connected graphs, Removable edges in cycles of a \(k\)-connected graph, Resistance distance in wheels and fans, Trivially noncontractible edges in a contraction critically 5-connected graph, The number of vertices of degree 5 in a contraction-critically 5-connected graph, The regular matroids with no 5-wheel minor, 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 \), Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions, The number of vertices of degree 7 in a contraction-critical 7-connected graph, Some properties of contraction-critical 5-connected graphs, Contractible edges and removable edges in 3-connected graphs, Minor obstructions for apex-pseudoforests, Contractible edges and contractible triangles in a 3-connected graph, 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, Generating closed 2-cell embeddings in the torus and the projective plane, On highly regular strongly regular graphs, Contractible non-edges in \(3\)-connected graphs, A constructive characterization of contraction critical 8-connected graphs with minimum degree 9, A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs, How to contract a vertex transitive 5-connected graph, On the structure of 3-connected matroids and graphs, Contractible circuits in \(3\)-connected graphs, Strengthened chain theorems for different versions of 4-connectivity, Contractible subgraphs in 3-connected graphs, Almost all 3-connected graphs contain a contractible set of \(k\) vertices, Generating internally four-connected graphs, Contractible and removable edges in 3-connected infinite graphs, Determination of the bases of a splitting matroid
