scientific article; zbMATH DE number 905032
From MaRDI portal
Publication:4885572
zbMath0847.05094MaRDI QIDQ4885572
Publication date: 16 July 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
treealgorithmsplit graphsimilarityembeddingshypercubesHamming distancecoloringsplit systemmetricssplit decompositionBuneman graphzonotopal planarityzonotopal tessellation
Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15) Enumerative combinatorics (05A99) Distance in graphs (05C12) Graph theory (05C99) Combinatorial aspects of tessellation and tiling problems (05B45) Genetics and population dynamics (92D99) Mathematical biology in general (92B99) Finite geometry and special incidence structures (51E99)
Related Items
When Can Splits be Drawn in the Plane?, A cognitive network for oracle bone characters related to animals, Analyzing and visualizing sequence and distance data using SPLITSTREE, Characterizing weak compatibility in terms of weighted quartets
