Matching and spanning trails in digraphs

DOI10.1016/j.dam.2021.08.014zbMath1473.05246OpenAlexW3196961715MaRDI QIDQ2231788

Juan Liu, Jia Wei, Xindong Zhang, Hong-Jian Lai, Omaema Lasfar

Publication date: 30 September 2021

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

Full work available at URL: https://doi.org/10.1016/j.dam.2021.08.014

zbMATH Keywords

maximum matchingstrong arc connectivitysupereulerian digraphsChvátal-Erdös conditiondirected trails

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Ore-type degree condition of supereulerian digraphs
• On cycles in multipartite tournaments
• Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments
• Supereulerian digraphs
• A note on Hamiltonian circuits
• Supereulerian Digraphs with Large Arc-Strong Connectivity
• A note on graphs spanned by Eulerian graphs
• TWO THEOREMS IN GRAPH THEORY
• Long Cycles in Digraphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• Supereulerian bipartite digraphs
• Sufficient Conditions for a Digraph to be Supereulerian
• Digraphs

This page was built for publication: Matching and spanning trails in digraphs