Spanning eulerian subdigraphs in semicomplete digraphs

A digraph is eulerian if it is connected and every vertex has its in‐degree equal to its out‐degree. Having a spanning eulerian subdigraph is thus a weakening of having a hamiltonian cycle. In this paper, we first characterize the pairs (D,a) $(D,a)$ of a semicomplete digraph D $D$ and an arc a $a$...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of graph theory Vol. 102; no. 3; pp. 578 - 606
Main Authors:	Bang‐Jensen, Jørgen, Havet, Frédéric, Yeo, Anders
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc 01.03.2023
Subjects:	Apexes arc‐connectivity eulerian subdigraph Graph theory polynomial algorithm semicomplete digraph tournament
ISSN:	0364-9024, 1097-0118
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!