A sufficient condition for cyclability in directed graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3149611 (Why is no real title available?)
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- scientific article; zbMATH DE number 908788 (Why is no real title available?)
- 2‐neighborhoods and hamiltonian conditions
- Cycles through prescribed vertices with large degree sum
- Directed hamiltonian graphs
- Graph theory
- Sequences, claws and cyclability of graphs
- Sufficient Conditions for Circuits in Graphs†
- Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
Cited in
(13)- scientific article; zbMATH DE number 773235 (Why is no real title available?)
- Structural conditions for cycle completable graphs
- scientific article; zbMATH DE number 819129 (Why is no real title available?)
- A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
- A sufficient condition for all short cycles
- scientific article; zbMATH DE number 5994590 (Why is no real title available?)
- Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs
- Disjoint Cycles in a Digraph with Partial Degree
- scientific article; zbMATH DE number 4127255 (Why is no real title available?)
- scientific article; zbMATH DE number 4066925 (Why is no real title available?)
- scientific article; zbMATH DE number 3993611 (Why is no real title available?)
- A sufficient condition guaranteeing large cycles in graphs
- scientific article; zbMATH DE number 5371443 (Why is no real title available?)
This page was built for publication: A sufficient condition for cyclability in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878617)