Hamiltonian Cycles Avoiding a Spanning Forest or a Spanning Cycle Subgraph in Tournaments

Bang-Jensen, Gutin and Yeo [Combin. Probab. Comput. 6(3) (1997) 255–261] investigated hamiltonian cycles avoiding the union of disjoint cliques in tournaments: for a k -strong tournament T = ( V , A ) on n vertices, a partition X 1 , X 2 , … , X p of V with | X 1 | ≤ | X 2 | ≤ ⋯ ≤ | X p | , and a di...

Full description

Saved in:

Bibliographic Details
Published in:	Graphs and combinatorics Vol. 41; no. 6; p. 129
Main Authors:	Di, Yaoxiang, Li, Ruijuan, Zhang, Xinhong
Format:	Journal Article
Language:	English
Published:	Tokyo Springer Japan 01.12.2025 Springer Nature B.V
Subjects:	Apexes Combinatorics Connectivity Engineering Design Graph theory Mathematics Mathematics and Statistics Original Paper Tournaments & championships 05C20 05C45 Avoiding arcs Hamiltonian cycle Spanning cycle subgraph Tournament Spanning forest 05C05
ISSN:	0911-0119, 1435-5914
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!