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$...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of graph theory Ročník 102; číslo 3; s. 578 - 606
Hlavní autori:	Bang‐Jensen, Jørgen, Havet, Frédéric, Yeo, Anders
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken Wiley Subscription Services, Inc 01.03.2023
Predmet:	Apexes arc‐connectivity eulerian subdigraph Graph theory polynomial algorithm semicomplete digraph tournament
ISSN:	0364-9024, 1097-0118
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!