Spanning Eulerian subdigraph in line digraphs

DOI10.1007/S42967-025-00505-2MaRDI QIDQ7312844zbMATH OpenFDO

Authors Juan Liu, Hong Yang, Xindong Zhang, Hong-Jian Lai

Publication date 12 August 2026

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

Full work available at URL https://doi.org/10.1007/S42967-025-00505-2

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• A reduction method to find spanning Eulerian subgraphs
• Digraphs
• Graph theory
• Hamiltonian-connected line digraphs
• scientific article; zbMATH DE number 1792587 (Why is no real title available?)
• Locally dense supereulerian digraphs
• Matching and spanning trails in digraphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On the linegraph of a directed-graph
• Ore-type degree condition of supereulerian digraphs
• Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments
• Sufficient conditions for a digraph to be supereulerian
• Supereulerian bipartite digraphs
• Supereulerian digraphs
• Supereulerian digraphs with given local structures
• Supereulerian digraphs with large arc-strong connectivity
• Supereulerian graphs: A survey
• Symmetric core and spanning trails in directed networks
• The spanning subgraphs of eulerian graphs

This page was built for publication: Spanning Eulerian subdigraph in line digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312844)