The following pages link to (Q4871748):
Displaying 50 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 Dirac theorem for trestles (Q427855) (← links)
- Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs (Q497365) (← links)
- A \(k\)-tree containing specified vertices (Q604665) (← links)
- \(\alpha\)-degree closures for graphs (Q658065) (← links)
- Compatible Hamilton cycles in Dirac graphs (Q681601) (← links)
- On existence theorems (Q686508) (← links)
- Girth and treewidth (Q707020) (← links)
- Set-orderedness as a generalization of \(k\)-orderedness and cyclability (Q708377) (← links)
- Splits of circuits (Q710606) (← links)
- Closure and spanning \(k\)-trees (Q742606) (← links)
- Hamiltonicity of 3-arc graphs (Q742645) (← links)
- A bypassing path based routing algorithm for the pyramid structures (Q856156) (← links)
- Hamiltonicity and colorings of arrangement graphs (Q860408) (← links)
- Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach (Q941336) (← links)
- Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture (Q949757) (← links)
- Hamiltonian degree sequences in digraphs (Q974465) (← links)
- Pancyclicity of Hamiltonian and highly connected graphs (Q974472) (← links)
- On a cycle partition problem (Q998373) (← links)
- On degree sum conditions for long cycles and cycles through specified vertices (Q998401) (← links)
- Partial cubes: Structures, characterizations, and constructions (Q998441) (← links)
- A spectral lower bound for the treewidth of a graph and its consequences (Q1014419) (← links)
- A degree sum condition concerning the connectivity and the independence number of a graph (Q1014827) (← links)
- Degree condition for subdivisions of unicyclic graphs (Q1015434) (← links)
- Hamiltonian cycles and dominating cycles passing through a linear forest (Q1024474) (← links)
- Covering the vertices of a graph with cycles of bounded length (Q1025448) (← links)
- On pseudo 2-factors (Q1028474) (← links)
- Dirac's type sufficient conditions for hamiltonicity and pancyclicity (Q1043808) (← links)
- A degree sum condition with connectivity for relative length of longest paths and cycles (Q1045188) (← links)
- Connected Cayley graphs of semi-direct products of cyclic groups of prime order by Abelian groups are Hamiltonian (Q1055437) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- Independent dominating sets and a second hamiltonian cycle in regular graphs (Q1386422) (← links)
- Intersections of longest cycles in \(k\)-connected graphs (Q1386428) (← links)
- Chords of longest cycles in cubic graphs (Q1386433) (← links)
- On the number of cycles in 3-connected cubic graphs (Q1386478) (← links)
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs (Q1405121) (← links)
- Interval degree and bandwidth of a graph (Q1406031) (← links)
- The calculation of average distance in mesh structures. (Q1416347) (← links)
- Covers of Eulerian graphs (Q1417961) (← links)
- Connectivity of \(k\)-extendable graphs with large \(k\). (Q1421484) (← links)
- Vertices of small degree in uniquely Hamiltonian graphs (Q1569030) (← links)
- Weakly pancyclic graphs (Q1569055) (← links)
- Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture (Q1569075) (← links)
- The average diameter and its estimation in nonlinear structures (Q1586279) (← links)
- A cycle of maximum order in a graph of high minimum degree has a chord (Q1684648) (← links)
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs (Q1732099) (← links)
- \((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets (Q1741582) (← links)
- Resolution cannot polynomially simulate compressed-BFS (Q1776193) (← links)
- On the domination search number (Q1811076) (← links)
