scientific article; zbMATH DE number 3600073
From MaRDI portal
Publication:4166780
zbMath0386.05039MaRDI QIDQ4166780
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (42)
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ On the structure of \(C_3\)-critical minimal 6-connected graphs ⋮ Reduction for 3-connected graphs of minimum degree at least four ⋮ Contractible edges in a 4-connected graph with vertices of degree greater than four ⋮ A chain theorem for 4-connected graphs ⋮ Reductions of 3-connected graphs with minimum degree at least four ⋮ Removable edges in cyclically 4-edge-connected cubic graphs ⋮ Contractible cliques in \(k\)-connected graphs ⋮ A constructive characterization of 4-connected graphs ⋮ Generalizaions of critical connectivity of graphs ⋮ Face extensions in planar cubic graphs ⋮ Contractible edges and liftable vertices in a 4-connected graph ⋮ Max-min weight balanced connected partition ⋮ Contractions of 6-connected toroidal graphs ⋮ On local structure of 9- and 10-connected graphs ⋮ Vertices of degree 6 in a contraction critically 6-connected graph ⋮ On some conjectures on cubic 3-connected graphs ⋮ Minimally contraction-critically 6-connected graphs ⋮ Non removable edges in 3-connected cubic graphs ⋮ Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph ⋮ Snarks with special spanning trees ⋮ Contractible edges in \(k\)-connected graphs with some forbidden subgraphs ⋮ Contractible edges in minimally \(k\)-connected graphs ⋮ Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph ⋮ Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph ⋮ 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 ⋮ Trivially noncontractible edges in a contraction critically 5-connected graph ⋮ The number of vertices of degree 5 in a contraction-critically 5-connected graph ⋮ A recursive characterization of the 4-connected graphs ⋮ On vertices of degree 6 of minimal and contraction critical 6-connected graph ⋮ Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph ⋮ Edges not contained in triangles and the number of contractible edges in a 4-connected graph ⋮ Cycle spectra of contraction-critically 4-connected planar graphs ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ Unnamed Item ⋮ A constructive characterization of contraction critical 8-connected graphs with minimum degree 9 ⋮ Strengthened chain theorems for different versions of 4-connectivity ⋮ High connectivity keeping sets in graphs and digraphs ⋮ Contractible edges and triangles in \(k\)-connected graphs ⋮ Vertices of degree 6 in a 6-contraction critical graph
This page was built for publication:
