Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles

Publisher： John Wiley & Sons Inc

E-ISSN： 1097-0118|79|4|249-266

ISSN： 0364-9024

Source： JOURNAL OF GRAPH THEORY, Vol.79, Iss.4, 2015-08, pp. : 249-266

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Extendable Cycles in Multipartite Tournaments

By Guo Yubao   Volkmann Lutz  

Graphs and Combinatorics, Vol. 20, Iss. 2, 2004-06 ,pp. : 185-190

Springer Publishing Company

Access to resources Recommend Favorite

Partitioning a graph into vertex-disjoint paths

By Li Jianping   Steiner George  

Studia Scientiarum Mathematicarum Hungarica, Vol. 42, Iss. 3, 2005-08 ,pp. : 277-294

Akademiai Kiado

Access to resources Recommend Favorite

Selecting vertex disjoint paths in plane graphs

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 66, Iss. 2, 2015-09 ,pp. : 136-144

John Wiley & Sons Inc

Access to resources Recommend Favorite

Cycles Containing a Given Arc in Regular Multipartite Tournaments

By Zhou Guo-fei   Zhang Ke-min  

Acta Mathematicae Applicatae Sinica, Vol. 18, Iss. 4, 2002-11 ,pp. : 681-684

Springer Publishing Company

Access to resources Recommend Favorite

Star graph automorphisms and disjoint Hamilton cycles

By Derakhshan Parisa   Hussak Walter  

International Journal of Computer Mathematics, Vol. 90, Iss. 3, 2013-03 ,pp. : 483-496

Taylor & Francis Ltd

Access to resources Recommend Favorite