Supereulerian digraphs with given diameter

DOI10.1016/J.AMC.2018.01.052zbMath1427.05124OpenAlexW2792250381WikidataQ130181603 ScholiaQ130181603MaRDI QIDQ2318192

Juan Liu, Xindong Zhang, Changchang Dong

Publication date: 14 August 2019

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

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

zbMATH Keywords

distancediameterspanning closed ditrailsuper-Eulerian digraph

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Plane augmentation of plane graphs to meet parity constraints ⋮ Subeulerian oriented graphs ⋮ Sufficient Ore type condition for a digraph to be supereulerian

Cites Work

• Unnamed Item
• Unnamed Item
• Ore-type degree condition of supereulerian digraphs
• On cycles in multipartite tournaments
• Supereulerian digraphs
• Supereulerian Digraphs with Large Arc-Strong Connectivity
• A note on graphs spanned by Eulerian graphs
• Reduced graphs of diameter two
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• Sufficient Conditions for a Digraph to be Supereulerian
• Digraphs
• Supereulerian digraphs with given local structures

This page was built for publication: Supereulerian digraphs with given diameter