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 subgraphscompetition graphsisolated verticescompetition relation

Mathematics Subject Classification ID

Ecology (92D40) Graph theory (05C99)

Related Items

Inverting Signed Graphs, Competition hypergraphs, Two-\(\phi\)-tolerance competition graphs, A generalization of Opsut's lower bounds for the competition number of a graph, Niche graphs, Competition graphs of degree bounded digraphs, The competition number of the complement of a cycle, \((i,j)\) competition graphs, Dimension-2 poset competition numbers and dimension-2 poset double competition numbers, Tolerance competition graphs, \(p\)-competition graphs, On upper bound graphs with edge operations, Phylogeny numbers, Upper bound multigraphs for posets, Applications of edge coverings by cliques, Unnamed Item, Competition polysemy, A characterization of competition graphs, A characterization of competition graphs of arbitrary digraphs, Inverting graphs of rectangular matrices

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