Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Rosalind A. Cameron"'
Autor:
Andrea Burgess, Nancy E. Clarke, Rosalind A. Cameron, Peter Danziger, Stephen Finbow, Caleb W. Jones, David A. Pike
Publikováno v:
Discrete Applied Mathematics. 285:552-566
We introduce the game of Surrounding Cops and Robbers on a graph, as a variant of the original game of Cops and Robbers. In contrast to the original game in which the cops win by occupying the same vertex as the robber, they now win by occupying each
Autor:
Rosalind A. Cameron, David A. Pike
Publikováno v:
The Electronic Journal of Combinatorics. 27
The 2-block intersection graph (2-BIG) of a twofold triple system (TTS) is the graph whose vertex set is composed of the blocks of the TTS and two vertices are joined by an edge if the corresponding blocks intersect in exactly two elements. The 2-BIG
Autor:
Rosalind A. Cameron, Daniel Horsley
In 1979 Tarsi showed that an edge decomposition of a complete multigraph into stars of size $m$ exists whenever some obvious necessary conditions hold. In 1992 Lonc gave necessary and sufficient conditions for the existence of an edge decomposition o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ab96ef4bde6ab647a2b43ea35d3ac3d
http://arxiv.org/abs/1807.10738
http://arxiv.org/abs/1807.10738