Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs

DOI10.1016/j.disc.2023.113867OpenAlexW4390802274MaRDI QIDQ6197735

No author found.

Publication date: 19 February 2024

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

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

zbMATH Keywords

contractionsymmetric coresemicomplete bipartite digraphssupereulerian digraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Ore-type degree condition of supereulerian digraphs
• Locally dense supereulerian digraphs
• Bipartite graphs and digraphs with maximum connectivity
• On super restricted edge connectivity of half vertex transitive graphs
• Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments
• Supereulerian digraphs
• Supereulerian Digraphs with Large Arc-Strong Connectivity
• A note on graphs spanned by Eulerian graphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• Supereulerian bipartite digraphs
• Sufficient Conditions for a Digraph to be Supereulerian
• Digraphs
• Supereulerian digraphs with given local structures
• Spanning eulerian subdigraphs in semicomplete digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs