The following pages link to Some Theorems on Abstract Graphs (Q5812733):
Displaying 50 items.
- Some sufficient conditions for Hamiltonian property in terms of Wiener-type invariants (Q263846) (← links)
- On the optimality of Bellman-Ford-Moore shortest path algorithm (Q266282) (← links)
- Global cycle properties of locally isometric graphs (Q266915) (← links)
- Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs (Q266958) (← links)
- Circumferences of 3-connected claw-free graphs (Q267172) (← links)
- A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs (Q268267) (← links)
- Stability and Ramsey numbers for cycles and wheels (Q271630) (← links)
- Large degree vertices in longest cycles of graphs. I (Q274689) (← links)
- On star-wheel Ramsey numbers (Q295255) (← links)
- On fan-wheel and tree-wheel Ramsey numbers (Q297927) (← links)
- Minimum implicit degree condition restricted to claws for Hamiltonian cycles (Q308339) (← links)
- Cycles and matchings in randomly perturbed digraphs and hypergraphs (Q322218) (← links)
- On a degree sequence analogue of Pósa's conjecture (Q322234) (← links)
- Local resilience of spanning subgraphs in sparse random graphs (Q322312) (← links)
- Stability in the Erdős-Gallai theorems on cycles and paths (Q326812) (← links)
- Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs (Q327292) (← links)
- Hamiltonian cycles in critical graphs with large maximum degree (Q343761) (← links)
- Counting and packing Hamilton cycles in dense graphs and oriented graphs (Q345082) (← links)
- An Ore-type theorem on Hamiltonian square cycles (Q354425) (← links)
- On the cycle spectrum of cubic Hamiltonian graphs (Q354467) (← links)
- An implicit degree condition for pancyclicity of graphs (Q367090) (← links)
- Advanced lower bounds for the circumference (Q367097) (← links)
- An implicit degree Ore-condition for pancyclicity of graphs (Q383626) (← links)
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779) (← links)
- Precise location of vertices on Hamiltonian cycles (Q394220) (← links)
- Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs (Q394360) (← links)
- Dominating circuits in regular matroids (Q395251) (← links)
- Hamilton cycles in implicit claw-heavy graphs (Q402356) (← links)
- Ore's condition for completely independent spanning trees (Q406328) (← links)
- Perfect matchings in 3-partite 3-uniform hypergraphs (Q406558) (← links)
- A sufficient condition for the existence of an anti-directed 2-factor in a directed graph (Q409370) (← links)
- Hamiltonian cycles with all small even chords (Q409469) (← links)
- On extremal hypergraphs for Hamiltonian cycles (Q412248) (← links)
- A survey on Hamilton cycles in directed graphs (Q412269) (← links)
- Some new bounds on partition critical hypergraphs (Q412276) (← links)
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels (Q423641) (← links)
- A Dirac theorem for trestles (Q427855) (← links)
- Improved degree conditions for Hamiltonian properties (Q432715) (← links)
- An implicit degree condition for Hamiltonian graphs (Q432725) (← links)
- Proper connection of graphs (Q442366) (← links)
- Endpoint extendable paths in dense graphs (Q442374) (← links)
- Locating pairs of vertices on Hamiltonian cycles (Q442398) (← links)
- Euler index in uncertain graph (Q449488) (← links)
- A characterization of partial blocks in weighted graphs (Q456097) (← links)
- On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem (Q456147) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- An implicit weighted degree condition for heavy cycles (Q472135) (← links)
- Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
- On the KŁR conjecture in random graphs (Q476516) (← links)
