scientific article; zbMATH DE number 1286502

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199804)27:4<223::AID-JGT3>3.0.CO;2-P" /><223::AID-JGT3>3.0.CO;2-P 10.1002/(SICI)1097-0118(199804)27:4<223::AID-JGT3>3.0.CO;2-PzbMath0919.05050MaRDI QIDQ4242950

André Kündgen

Publication date: 11 May 1999

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

zbMATH Keywords

complete bipartite graphisoperimetric problemcliquecovercomplete graphbicliquespanning stars

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

On the biclique cover of the complete graph ⋮ Covering complete hypergraphs with cuts of minimum total size ⋮ On the minimum average distance of binary constant weight codes ⋮ A bound on the total size of a cut cover ⋮ On the variance of average distance of subsets in the Hamming space ⋮ On the minimum average distance of binary codes: Linear programming approach ⋮ Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs ⋮ AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES

This page was built for publication: