Pages that link to "Item:Q1901041"
From MaRDI portal
The following pages link to Cycles through prescribed vertices with large degree sum (Q1901041):
Displaying 27 items.
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779) (← links)
- On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem (Q456147) (← links)
- A \(k\)-tree containing specified vertices (Q604665) (← links)
- Set-orderedness as a generalization of \(k\)-orderedness and cyclability (Q708377) (← links)
- A new sufficient condition for pancyclability of graphs (Q741733) (← links)
- A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs (Q868356) (← links)
- A sufficient condition for cyclability in directed graphs (Q878617) (← links)
- Long paths with endpoints in given vertex-subsets of graphs (Q941396) (← links)
- Hamiltonicity of 4-connected graphs (Q966553) (← links)
- On degree sum conditions for long cycles and cycles through specified vertices (Q998401) (← links)
- A sufficient condition for pancyclability of graphs (Q998503) (← 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)
- Cycles through subsets with large degree sums (Q1363686) (← links)
- Cycles through given vertices and closures (Q1422413) (← links)
- On short cycles through prescribed vertices of a graph (Q1883253) (← links)
- A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs (Q2023732) (← links)
- The maximum size of a nonhamiltonian graph with given order and connectivity (Q2092432) (← 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)
- Cycles and paths through specified vertices (Q2719964) (← links)
- An Implicit Degree Condition for Cyclability in Graphs (Q3004658) (← links)
- Embedding spanning subgraphs in uniformly dense and inseparable graphs (Q3386528) (← links)
- Cycles through vertices of large maximum degree (Q4326536) (← links)
- A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity (Q5210982) (← links)
