Supereulerian 3-path-quasi-transitive digraphs

DOI10.1016/J.AMC.2019.124964zbMath1433.05134OpenAlexW2997088401WikidataQ126424566 ScholiaQ126424566MaRDI QIDQ2287800

Changchang Dong, Juan Liu, Ji Xiang Meng

Publication date: 21 January 2020

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.124964

zbMATH Keywords

independence numberarc-strong connectivitysupereulerian digraphEulerian factor3-path-quasi-transitive digraphspanning closed ditrail

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Subeulerian oriented graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the structure of strong 3-quasi-transitive digraphs
• The structure of strong arc-locally in-semicomplete digraphs
• The structure of strong arc-locally semicomplete digraphs
• A conjecture on 3-anti-quasi-transitive digraphs
• A note on Hamiltonian circuits
• Supereulerian Digraphs with Large Arc-Strong Connectivity
• Long Cycles in Digraphs
• Supereulerian graphs: A survey
• Sufficient Conditions for a Digraph to be Supereulerian
• Digraphs

This page was built for publication: Supereulerian 3-path-quasi-transitive digraphs