Living on the edges: user-centered design and the dynamics of specialization in organizations

In 1956, Tutte proved that a 4-connected planar graph is Hamiltonian. Moreover, in 1997, Sanders extended this to the result that a 4-connected planar graph contains a Hamiltonian cycle through any two of its edges. Harant and Senitsch [J. Harant, S. ...

An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. A k-connected graph with no k-contractible edge is said to be contraction critically k-connected. An edge of a k-connected graph ...

An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. In this paper, we prove that a (K"1+C"4)-free minimally k-connected graph has a k-contractible edge, if incident to each vertex of ...