Phylogeny numbers

DOI10.1016/S0166-218X(98)00058-4zbMath0907.05024OpenAlexW2913240917MaRDI QIDQ1270783

Li Sheng, Fred S. Roberts

Publication date: 11 February 1999

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

acyclic digraphphylogeny digraphphylogeny graphphylogeny number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Ecology (92D40) Graph algorithms (graph-theoretic aspects) (05C85) Linguistics (91F20) Directed graphs (digraphs), tournaments (05C20)

Related Items

On the phylogeny graphs of degree-bounded digraphs, Competition numbers and phylogeny numbers: uniform complete multipartite graphs, The elimination procedure for the competition number is not optimal, Phylogeny numbers for graphs with two triangles, Phylogeny numbers of generalized Hamming graphs

Cites Work

• On rigid circuit graphs
• A characterization of competition graphs
• A characterization of graphs of competition number m
• A characterization of competition graphs of arbitrary digraphs
• Competition numbers of graphs with a small number of triangles
• Incidence matrices and interval graphs
• Representation of a finite graph by a set of intervals on the real line
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• Competitive inheritance and limitedness of graphs
• On the Computation of the Competition Number of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item