Extremal and Degree Conditions for Path Extendability in Digraphs

DOI10.1137/16M1077453zbMath1370.05083OpenAlexW2752038467MaRDI QIDQ5357959

Dingjun Lou, Zan-Bo Zhang, Xiaoyan Zhang, Hajo J. Broersma

Publication date: 18 September 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/16m1077453

zbMATH Keywords

digraphregular tournamentcycle extendabilitypath extendability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments ⋮ Permanence and almost periodic solution of two-species delayed Lotka–Volterra cooperative systems with impulsive perturbations ⋮ Connectivity and extendability in digraphs

Cites Work

• Unnamed Item
• Extending cycles in directed graphs
• Path extendable graphs
• Extending cycles in bipartite graphs
• Hamiltonian-connected tournaments
• Completely strong path-connected tournaments
• Pancyclic graphs. I
• Bypasses in asymmetric digraphs
• Vertex pancyclic in-tournaments
• Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in‐tournaments
• Hamiltonian Chordal Graphs are not Cycle Extendable
• Hamiltonian Spider Intersection Graphs Are Cycle Extendable
• Digraphs
• Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes
• Cycle Extendability of Hamiltonian Interval Graphs

This page was built for publication: Extremal and Degree Conditions for Path Extendability in Digraphs