Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey |
SpringerLink Skip to main content Advertisement SpringerLink Log in Menu Find a journal …

Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle | SpringerLink Skip to
main content Advertisement SpringerLink Log in Menu Find a journal Publish with us Search …

Given a fixed graph H, we provide a sharp degree-sum condition such that if a graph G is
sufficiently large with sufficiently large minimum degree sum, then it contains a spanning H …

We prove a sharp connectivity and degree sum condition for the existence of a subdivision
of a multigraph in which some of the vertices are specified and the distance between each …

First by using an easy application of the Regularity Lemma, we extend some known results
about cycles of many lengths to include a specified edge on the cycles. The results in this …

First by using an easy application of the Regularity Lemma, we extend some known results
about cycles of many lengths to include a specified edge on the cycles. The results in this …