On the phylogeny graphs of degree-bounded digraphs

DOI10.1016/j.dam.2017.07.018zbMath1372.05088arXiv1611.00246OpenAlexW2547718304MaRDI QIDQ2410253

Suh-Ryung Kim, Yoshio Sano, Jihoon Choi, Seung-Chul Lee

Publication date: 17 October 2017

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

Full work available at URL: https://arxiv.org/abs/1611.00246

zbMATH Keywords

chordal graphcompetition graphphylogeny graphmoral graph\((2, 2)\)-digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Competition graphs of degree bounded digraphs ⋮ Competition numbers and phylogeny numbers: uniform complete multipartite graphs ⋮ On chordal phylogeny graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable
• A sufficient condition for Kim's conjecture on the competition numbers of graphs
• Fusion, propagation, and structuring in belief networks
• The (1,2)-step competition graph of a tournament
• Competition numbers of complete \(r\)-partite graphs
• On rigid circuit graphs
• \((i,j)\) competition graphs
• Phylogeny numbers
• Phylogeny numbers for graphs with two triangles
• Transversals and competition numbers of complete multipartite graphs
• The computational complexity of probabilistic inference using Bayesian belief networks
• Probabilistic Inference and Influence Diagrams
• The phylogeny graphs of double partial orders

This page was built for publication: On the phylogeny graphs of degree-bounded digraphs