scientific article

From MaRDI portal
Publication:3424715

zbMath1110.05306MaRDI QIDQ3424715

Gennian Ge

Publication date: 5 March 2007


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (38)

The spectrum problem for digraphs of order 4 and size 5Group divisible designs with block size five from Clatworthy's tableGroup divisible designs with block size four and type \(g^ub^1 (gu/2)^1\)Petersen graph decompositions of complete multipartite graphsArchimedean graph designsThe flower intersection problem for \(S(2,4,v)\)'sCombinational constructions of splitting authentication codes with perfect secrecyDecompositions of complete symmetric directed graphs into the oriented heptagonsEquiangular tight frames from group divisible designsDecomposing the complete graph into dodecahedraMatching divisible designs with block size fourPentagonal geometries with block sizes 3, 4, and 5Holey Schröder designs of type \(3^n u^1\)Completely reducible super-simple designs with block size four and related super-simple packingsHoley perfect Mendelsohn designs of type \(2^nu^1\) with block size fourUnnamed ItemRoom squares with super-simple propertyTriple systems and binary operationsThe existence spectrum for \((3,\lambda)\)-GDDs of type \(g^t u^1\)Latin directed triple systemsDesigns for graphs with six vertices and ten edges -- IIOptimal ternary constant-composition codes with weight four and distance sixQuasigroups satisfying Stein's third law with a specified number of idempotentsDoyen-Wilson theorem for perfect hexagon triple systemsGeneralizing Clatworthy group divisible designsUnnamed ItemUnnamed ItemThe spectrum problem for the connected cubic graphs of order 10Existence of incomplete canonical Kirkman covering designsA complete solution to the spectrum problem for graphs with six vertices and up to nine edgesUnnamed ItemOn decomposing the complete symmetric digraph into orientations of \(K_4 - e\)Schröder quasigroups with a specified number of idempotentsUnnamed ItemSmallest defining sets of directed triple systemsEmbedding 5-cycle systems into pentagon triple systemsDesigns for graphs with six vertices and ten edgesHanani triple packings and optimal \(q\)-ary codes of constant weight three




This page was built for publication: