Counting vertices and cubes in median graphs of circular split systems
From MaRDI portal
Publication:2472839
DOI10.1016/j.ejc.2007.02.003zbMath1135.05069OpenAlexW2084463402MaRDI QIDQ2472839
Publication date: 25 February 2008
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2007.02.003
Applications of graph theory (05C90) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Mathematical biology in general (92B99)
Related Items (3)
Injective split systems ⋮ Two-ended regular median graphs ⋮ Transitive, locally finite median graphs with finite blocks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex
- On the structure of the tight-span of a totally split-decomposable metric
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Superextensions and the depth of median graphs
- A canonical decomposition theory for metrics on a finite set
- On the number of vertices and edges of the Buneman graph
- An Euler-type formula for median graphs
- The cube polynomial and its derivatives: The case of median graphs
- \(T\)-theory: An overview
- An exceptional split geometry
- Metric Ternary Distributive Semi-Lattices
- Retracts of hypercubes
- Graphs Orientable as Distributive Lattices
This page was built for publication: Counting vertices and cubes in median graphs of circular split systems
