Spanning connectedness and Hamiltonian thickness of graphs and interval graphs
Spanning connectedness and Hamiltonian thickness of graphs and interval graphs
A spanning connectedness property is one which involves the robust existence of a spanning subgraph which is of some special form, say a Hamiltonian cycle in which a sequence of vertices appear in an arbitrarily given ordering, or a Hamiltonian path in the subgraph obtained by deleting any three vertices, …