Results 181 to 190 of about 663 (192)
Some of the next articles are maybe not open access.
Novas invariantes para 1-fatorações do grafo K2n
Anais do Simpósio Brasileiro de Pesquisa Operacional, 2023Saulo Matos +3 more
openaire +1 more source
A characterisation of edge-affine 2-arc-transitive covers of K2n,2n
Journal of combinatorial theory. Series AThe family of finite 2-arc-transitive graphs of a given valency is closed under forming non-trivial normal quotients, and graphs in this family having no non-trivial normal quotient are called 'basic'. To date, the vast majority of work in the literature has focused on classifying these 'basic' graphs. By contrast we give here a characterisation of the
openaire +1 more source
Spanning trees orthogonal to one-factorizations of \(K_{2n}\).
Ars Comb., 2000The authors improve some results on the Hollingsworth-Brualdi conjecture which claims that for any one-factorization \(F\) of \(K_{2n}\) there exists a decomposition of \(K_{2n}\) into spanning trees orthogonal to \(F\). The authors construct three such trees for every \(K_{2n}\) (this result improves two such trees known before) and exhibit infinitely
John W. Krussel +2 more
openaire +2 more sources
Uniform coverings of 2-paths with 5-paths in \(K_{2n}\)
Australas. J Comb., 2003In 1905 \textit{H. E. Dudeney} [Amusements in mathematics (Nelson, Lord, 1917, and Dover reprint, New York, 1970)] proposed the problem to seat \(n\) persons at a round table on \((n-1)(n-2)/2\) occasions so that no person ever has the same two neighbours twice.
Midori Kobayashi +2 more
openaire +2 more sources
On invariants for 1-factorizations of K2n: Description and computation
Matos, Saulo +4 moreopenaire +1 more source
On the Existence of Rainbows in 1-Factorizations of K2n
Journal of Combinatorial Designs, 1998Hung-Lin Fu, David E Woolbright
exaly
The edge Seidel and minimum edge covering Seidel energy of the K1n and K2n graphs
Banihashemi Dehkordi, Akram Sadat +2 moreopenaire +1 more source