Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Peter Danziger"'
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a5f39f1e89469cc9eda00301580b23f
https://doi.org/10.1016/j.dam.2020.06.019
https://doi.org/10.1016/j.dam.2020.06.019
Publikováno v:
Discrete Mathematics. 342:2213-2222
The Hamilton–Waterloo Problem HWP ( v ; m , n ; α , β ) asks for a 2-factorization of the complete graph K v or K v − I , the complete graph with the edges of a 1-factor removed, into α C m -factors and β C n -factors, where 3 ≤ m n . In th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3fbffc6069e275db46e0f427d4436a7
https://doi.org/10.1016/j.disc.2019.04.013
https://doi.org/10.1016/j.disc.2019.04.013
Publikováno v:
The Electronic Journal of Combinatorics. 28
In this paper, we consider the problem of decomposing the complete directed graph $K_n^*$ into cycles of given lengths. We consider general necessary conditions for a directed cycle decomposition of $K_n^*$ into $t$ cycles of lengths $m_1, m_2, \ldot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f530e8d02a825a0cdc310242b862621
https://doi.org/10.37236/8219
https://doi.org/10.37236/8219
Publikováno v:
Discrete Mathematics. 340:416-425
Given a 2 - ( v , k , λ ) design, S = ( X , B ) , a zero-sum n -flow of S is a map f : B źsź { ź 1 , ź , ź ( n - 1 ) } such that for any point x ź X , the sum of f over all the blocks incident with x is zero. It has been conjectured that every
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b1299fcdb54db372421837c9d9367c4
https://doi.org/10.1016/j.disc.2016.08.014
https://doi.org/10.1016/j.disc.2016.08.014
Publikováno v:
Journal of Combinatorial Designs. 25:258-287
Given nonnegative integers v,m,n,α,β, the Hamilton–Waterloo problem asks for a factorization of the complete graph Kv into α Cm-factors and β Cn-factors. Without loss of generality, we may assume that n≥m. Clearly, v odd, n,m≥3, m∣v, n∣
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3794dbcc64f55c4be7951f75c7b8f79c
https://doi.org/10.1002/jcd.21552
https://doi.org/10.1002/jcd.21552
Let K v ∗ denote the complete graph K v if v is odd and K v − I , the complete graph with the edges of a 1-factor removed, if v is even. Given non-negative integers v , M , N , α , β , the Hamilton–Waterloo problem asks for a 2-factorization
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b83216c44531625f827d718a515cce9
http://hdl.handle.net/11379/515687
http://hdl.handle.net/11379/515687
Let Kv∗ denote the complete graph Kv if v is odd and Kv−I, the complete graph with the edges of a 1-factor removed, if v is even. Given nonnegative integers v,M,N,α,β, the Hamilton–Waterloo problem asks for a 2-factorization of Kv∗ into α
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94c747ab8e62f0eb0989b06c6a45eaad
http://hdl.handle.net/11379/515686
http://hdl.handle.net/11379/515686
Autor:
Marco Buratti, Peter Danziger
Publikováno v:
Graphs and Combinatorics. 32:521-531
The main result of this paper is the explicit construction, for any positive integer n, of a cyclic two-factorization of $$K_{50n+5}$$K50n+5 with $$20n+2$$20n+2 two-factors consisting of five $$(10n+1)$$(10n+1)-cycles and each of the remaining two-fa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ecabb2a7332813ba00a259b02bca7deb
https://doi.org/10.1007/s00373-015-1582-x
https://doi.org/10.1007/s00373-015-1582-x
A $2t$-cycle system of order $v$ is a set $\mathcal{C}$ of cycles whose edges partition the edge-set of $K_v-I$ (i.e., the complete graph minus the $1$-factor $I$). If $v\equiv 0 \pmod{2t}$, a set of $v/2t$ vertex-disjoint cycles of $\mathcal{C}$ is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::358a3aad8f417654cbda9e96a9a3cc13
http://hdl.handle.net/11379/515696
http://hdl.handle.net/11379/515696
Publikováno v:
Journal of Combinatorial Designs. 23:328-351
If a cycle decomposition of a graph G admits two resolutions, and , such that for each resolution class and , then the resolutions and are said to be orthogonal. In this paper, we introduce the notion of an orthogonally resolvable cycle decomposition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0a739d63f0378976402a659e551f13a
https://doi.org/10.1002/jcd.21404
https://doi.org/10.1002/jcd.21404