Replacing cliques by stars in quasi-median graphs

DOI10.1016/j.dam.2004.03.002zbMath1053.05040OpenAlexW2056184154MaRDI QIDQ1887054

Charles Semple, Katharina T. Huber, Vincent L. Moulton

Publication date: 23 November 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.03.002

zbMATH Keywords

SplitBuneman graph(in)compatibilityMulti-split graphQuasi-median graphStrong compatibility

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• From copair hypergraphs to median graphs with latent vertices
• On the number of vertices and edges of the Buneman graph
• The relation graph
• Trees, taxonomy, and strongly compatible multi-state characters
• Quasi-median graphs from sets of partitions