Zobrazeno 1 - 10
of 189
pro vyhledávání: '"J. W. Hilton"'
Publikováno v:
Discrete Applied Mathematics. 266:103-110
Two sets are weakly incomparable if neither properly contains the other; they are strongly incomparable if they are unequal and neither contains the other. Two families A and B of sets are weakly (or strongly) incomparable if no set in one of A and B
Autor:
Anitha Rajkumar, Anthony J. W. Hilton
Publikováno v:
Discrete Applied Mathematics. 209:153-163
For d1,s0, a (d,d+s)-graph is a graph whose degrees all lie in the interval {d,d+1,,d+s}. For r1,a0, an (r,r+a)-factor of a graph G is a spanning (r,r+a)-subgraph of G. An (r,r+a)-factorization of a graph G is a decomposition of G into edge-disjoint
Publikováno v:
Journal of Combinatorial Theory, Series A. 130:26-41
We generalize a theorem of M. Hall Jr., that an r × n Latin rectangle on n symbols can be extended to an n × n Latin square on the same n symbols. Let p, n, ? 1 , ? 2 , ? , ? n be positive integers such that 1 ? ? i ? p ( 1 ? i ? n ) and ? i = 1 n
Publikováno v:
Journal of Graph Theory. 74:275-308
A function between graphs is k-to-1 if each point in the codomain has precisely k preimages in the domain. In this article, we approach the topic of continuous, or finitely discontinuous, k-to-1 functions between graphs from three different points of
Publikováno v:
Journal of Combinatorial Designs. 19:268-279
In 1974 Cruse gave necessary and sufficient conditions for an r × s partial latin square P on symbols σ1,σ2,…,σt, which may have some unfilled cells, to be completable to an n × n latin square on symbols σ1,σ2,…,σn, subject to the conditi
Publikováno v:
Mathematika. 56:357-362
An (r,r+1)-factor of a graph G is a spanning subgraph H such that dH(v)∈{r,r+1} for all vertices v∈𝒱(G). If G is expressed as the union of edge-disjoint (r,r+1)-factors, then this expression is an (r,r+1)-factorization of G. Let μ(r) be the s
Publikováno v:
The Quarterly Journal of Mathematics. 62:625-635
A graph G is r-starred if, for some $v \in V(G)$, a largest pairwise intersecting family of independent r-subsets of V(G) may be obtained by taking all such subsets containing v (the 'r-star' at v). Let G be the disjoint union of powers of cycles; Hi
Autor:
Anthony J. W. Hilton
Publikováno v:
Discrete Mathematics. 310:288-302
For d>=1, s>=0 a (d,d+s)-graph is a graph whose degrees all lie in the interval {d,d+1,...,d+s}. For r>=1, a>=0 an (r,r+a)-factor of a graph G is a spanning (r,r+a)-subgraph of G. An (r,r+a)-factorization of a graph G is a decomposition of G into edg
Autor:
C. L. Spencer, Anthony J. W. Hilton
Publikováno v:
Journal of Combinatorial Theory, Series A. 116:1023-1033
Let G be a graph consisting of powers of disjoint cycles and let A be an intersecting family of independent r-sets of vertices. Provided that G satisfies a further condition related to the clique numbers of the powers of the cycles, then |A| will be
Autor:
A. J. W. Hilton
Publikováno v:
Journal of Graph Theory. 60:257-268