Supereulerian digraphs

DOI10.1016/J.DISC.2014.04.018zbMath1295.05116OpenAlexW4210529603MaRDI QIDQ2017061

Hong-Jian Lai, Yanmei Hong, Qinghai Liu

Publication date: 25 June 2014

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

Full work available at URL: https://doi.org/10.1016/j.disc.2014.04.018

zbMATH Keywords

supereulerian

Mathematics Subject Classification ID

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

Related Items (12)

Ore-type degree condition of supereulerian digraphs ⋮ An approximation algorithm for the clustered path travelling salesman problem ⋮ Unnamed Item ⋮ An approximation algorithm for the clustered path travelling salesman problem ⋮ Subeulerian oriented graphs ⋮ Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs ⋮ Locally dense supereulerian digraphs ⋮ Matching and spanning trails in digraphs ⋮ Symmetric core and spanning trails in directed networks ⋮ Supereulerian Digraphs with Large Arc-Strong Connectivity ⋮ Supereulerian digraphs with given local structures ⋮ Supereulerian digraphs with given diameter

Cites Work

• Unnamed Item
• A note on graphs spanned by Eulerian graphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs

This page was built for publication: Supereulerian digraphs