A characterization of graphs of competition number m

DOI10.1016/0166-218X(83)90086-0zbMath0521.05058MaRDI QIDQ1055444

J. Richard Lundgren, John S. Maybee

Publication date: 1983

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

zbMATH Keywords

complete subgraphs; competition graphs; isolated vertices; competition relation

Mathematics Subject Classification ID

92D40: Ecology

05C99: Graph theory

Related Items

Unnamed Item, Upper bound multigraphs for posets, Applications of edge coverings by cliques, Inverting graphs of rectangular matrices, Dimension-2 poset competition numbers and dimension-2 poset double competition numbers, On upper bound graphs with edge operations, A characterization of competition graphs, A characterization of competition graphs of arbitrary digraphs, Niche graphs, \((i,j)\) competition graphs, Phylogeny numbers, Tolerance competition graphs, \(p\)-competition graphs, Competition polysemy, Competition hypergraphs, Two-\(\phi\)-tolerance competition graphs, Inverting Signed Graphs

Cites Work

• On rigid circuit graphs
• Inverting graphs of rectangular matrices
• A characterization of competition graphs
• A characterization of competition graphs of arbitrary digraphs
• Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices
• On the Computation of the Competition Number of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item