Extremal and Degree Conditions for Path Extendability in Digraphs

DOI10.1137/16M1077453zbMath1370.05083MaRDI 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

digraph; regular tournament; cycle extendability; path extendability

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C38: Paths and cycles

05C20: Directed graphs (digraphs), tournaments

Related Items

Connectivity and extendability in digraphs, Permanence and almost periodic solution of two-species delayed Lotka–Volterra cooperative systems with impulsive perturbations

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