Pages that link to "Item:Q1363686"
From MaRDI portal
The following pages link to Cycles through subsets with large degree sums (Q1363686):
Displaying 20 items.
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779) (← links)
- Degree sum conditions for the circumference of 4-connected graphs (Q400404) (← links)
- A \(k\)-tree containing specified vertices (Q604665) (← links)
- Set-orderedness as a generalization of \(k\)-orderedness and cyclability (Q708377) (← links)
- A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs (Q868356) (← links)
- On a cycle through a specified linear forest of a graph (Q868359) (← links)
- A Chvátal--Erdős type condition for pancyclability (Q878642) (← links)
- Hamiltonicity of 4-connected graphs (Q966553) (← links)
- Forbidden subgraphs and the existence of paths and cycles passing through specified vertices (Q998348) (← links)
- On degree sum conditions for long cycles and cycles through specified vertices (Q998401) (← links)
- A degree sum condition concerning the connectivity and the independence number of a graph (Q1014827) (← links)
- Degree conditions and degree bounded trees (Q1025562) (← links)
- A look at cycles containing specified elements of a graph (Q1045026) (← links)
- On paths and cycles through specified vertices (Q1883258) (← links)
- A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs (Q2124605) (← links)
- An implicit degree sum condition for cycles through specified vertices (Q2410579) (← links)
- Disjoint cycles in hypercubes with prescribed vertices in each cycle (Q2446892) (← links)
- Relative length of longest paths and longest cycles in triangle-free graphs (Q2470001) (← links)
- On cycles through specified vertices (Q2495522) (← links)
- An Implicit Degree Condition for Cyclability in Graphs (Q3004658) (← links)
