Extending cycles in directed graphs

DOI10.1016/0095-8956(89)90042-7zbMath0626.05022OpenAlexW2087401575MaRDI QIDQ580359

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

zbMATH Keywords

digraphstrong tournamentscycle extendableregular tournaments

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (14)

Pancyclic orderings of in-tournaments ⋮ Degree conditions and cycle extendability ⋮ Cycle extendability in extended tournaments ⋮ Unnamed Item ⋮ Vertex pancyclic in-tournaments ⋮ Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments ⋮ Extremal and Degree Conditions for Path Extendability in Digraphs ⋮ \(c\)-pancyclic partial ordering and \((c-1)\)-pan-outpath partial ordering in semicomplete multipartite digraphs. ⋮ Cycle extendability in graphs and digraphs ⋮ Cycle Extendability of Hamiltonian Strongly Chordal Graphs ⋮ Extending cycles in graphs ⋮ Locally Semicomplete Digraphs and Generalizations ⋮ Regular tournaments with minimum split domination number and cycle extendability ⋮ Connectivity and extendability in digraphs

Cites Work

• Extending cycles in graphs
• On maximal circuits in directed graphs
• On Subtournaments of a Tournament
• Cycles of Each Length in Regular Tournaments
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extending cycles in directed graphs