Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Yu-Fong Hsu"'
Autor:
Yu-Fong Hsu, 徐育鋒
101
A complete graph with n vertices is a simple graph whose vertices are pairwise adjacent, denoted by Kn. A cycle with n vertices is called an n-cycle and is denoted (v1, v2, …, vn), where v1, v2, …, vn are the vertices of the cycle and v1
A complete graph with n vertices is a simple graph whose vertices are pairwise adjacent, denoted by Kn. A cycle with n vertices is called an n-cycle and is denoted (v1, v2, …, vn), where v1, v2, …, vn are the vertices of the cycle and v1
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/56379473683217211873
Publikováno v:
Discrete Mathematics. 313:726-732
A kite decomposition of a complete multipartite graph is said to be gregarious if each kite in the decomposition has its vertices in four different partite sets. In this paper, we give certain necessary and sufficient conditions for the existence of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9aa55d2fbdb69be070f40e84dde13f93
https://doi.org/10.1016/j.disc.2012.10.017
https://doi.org/10.1016/j.disc.2012.10.017
Publikováno v:
Discrete Mathematics. 313:498-507
A bull is a graph which is obtained by attaching two edges to two vertices of a triangle. A bull-design of order n is an ordered pair ( X , A ) , where X is the vertex set of K n and A is an edge-disjoint decomposition of K n into copies of bulls. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a577be001817491c8078beed34a09639
https://doi.org/10.1016/j.disc.2012.11.023
https://doi.org/10.1016/j.disc.2012.11.023