Extending cycles in directed graphs
From MaRDI portal
Publication:580359
DOI10.1016/0095-8956(89)90042-7zbMATH Open0626.05022OpenAlexW2087401575MaRDI QIDQ580359FDOQ580359
Authors: George R. T. Hendy 
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(89)90042-7
Recommendations
- Extending cycles in graphs
- Cycle extendability in graphs and digraphs
- Extending cycles in bipartite graphs
- On cycles of directed graphs
- Edge cycle extendable graphs
- scientific article; zbMATH DE number 6096657
- Extension of paths and cycles for hypergraphs
- Cycle extension in edge-colored complete graphs
- Cycle lengths in expanding graphs
- Extending vertex and edge pancyclic graphs
Cites Work
- Title not available (Why is that?)
- Some Theorems on Abstract Graphs
- Extending cycles in graphs
- On Subtournaments of a Tournament
- Title not available (Why is that?)
- On maximal circuits in directed graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cycles of Each Length in Regular Tournaments
Cited In (20)
- Cycle Extendability of Hamiltonian Strongly Chordal Graphs
- Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments
- Extending cycles in graphs
- Cycle extendability in graphs and digraphs
- Title not available (Why is that?)
- Cycle extendability and split domination in tournaments
- \(c\)-pancyclic partial ordering and \((c-1)\)-pan-outpath partial ordering in semicomplete multipartite digraphs.
- Connectivity and extendability in digraphs
- Pancyclic orderings of in-tournaments
- Vertex pancyclic in-tournaments
- Pancyclic orderings of in-tournaments
- An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cycle extendability in extended tournaments
- Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
- Locally Semicomplete Digraphs and Generalizations
- Extremal and degree conditions for path extendability in digraphs
- Regular tournaments with minimum split domination number and cycle extendability
- Degree conditions and cycle extendability
This page was built for publication: Extending cycles in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580359)
