Pages that link to "Item:Q3333075"

The following pages link to Long paths and large cycles in finite graphs (Q3333075):

Displaying 27 items.

• Stability in the Erdős-Gallai theorems on cycles and paths (Q326812) (← links)
• A Dirac theorem for trestles (Q427855) (← links)
• Long induced paths in graphs (Q518170) (← links)
• A generalization of Menger's theorem (Q654247) (← links)
• Long paths with endpoints in given vertex-subsets of graphs (Q941396) (← links)
• A generalization of Dirac's theorem (Q1065022) (← links)
• Longest paths joining given vertices in a graph (Q1088682) (← links)
• Extremal 3-connected graphs (Q1106857) (← links)
• On a generalization of a theorem of Nash-Williams (Q1179465) (← links)
• A new result about panconnectivity on graphs (Q1179497) (← links)
• On extremal graphs with no long paths (Q1379162) (← links)
• On the circumference of 3-connected graphs (Q1601399) (← links)
• Stability in the Erdős-Gallai theorem on cycles and paths. II (Q1709520) (← links)
• Long cycles through a linear forest (Q1850534) (← links)
• Long paths and cycles in dynamical graphs (Q1863052) (← links)
• Tutte paths and long cycles in circuit graphs (Q2099420) (← links)
• Long cycles passing through a linear forest (Q2175797) (← links)
• On 2-connected hypergraphs with no long cycles (Q2335701) (← links)
• A degree sum condition for long cycles passing through a linear forest (Q2427497) (← links)
• Fan-type theorem for long cycles containing a specified edge (Q2494104) (← links)
• Some degree bounds for the circumference of graphs (Q2568492) (← links)
• Long dominating cycles and paths in graphs with large neighborhood unions (Q3353048) (← links)
• Finding paths and cycles of superpolylogarithmic length (Q3581003) (← links)
• (Q3768926) (← links)
• Long cycles passing through a specified path in a graph (Q4242961) (← links)
• Monophonic convexity in weighted graphs (Q4603877) (← links)
• Long paths and cycles passing through specified vertices under the average degree condition (Q5964991) (← links)