scientific article; zbMATH DE number 905032
From MaRDI portal
Publication:4885572
algorithmBuneman graphcoloringembeddingsHamming distancehypercubesmetricssimilaritysplit decompositionsplit graphsplit systemtreezonotopal planarityzonotopal tessellation
Enumerative combinatorics (05A99) Combinatorial aspects of tessellation and tiling problems (05B45) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Applications of graph theory (05C90) Graph theory (05C99) Finite geometry and special incidence structures (51E99) Mathematical biology in general (92B99) Genetics and population dynamics (92D99)
Cited in
(5)- Characterizing weak compatibility in terms of weighted quartets
- A cognitive network for oracle bone characters related to animals
- Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors and Similarity Judgment Strategies
- When can splits be drawn in the plane?
- Analyzing and visualizing sequence and distance data using SPLITSTREE
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885572)
