On the public citation graph
Food webs, competition graphs, and the boxicity of ecological phase space
0 signed · 91 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02579232openalex-snapshot
Intersection properties of boxes in R d
inferredcites →https://doi.org/10.1016/0022-247x(70)90282-9openalex-snapshot
Triangulated graphs and the elimination process
inferredcites →https://doi.org/10.1137/1003021openalex-snapshot
The Use of Linear Graphs in Gauss Elimination
inferredcites →https://doi.org/10.2307/2090928openalex-snapshot
Structural Models: An Introduction to the Theory of Directed Graphs.
inferredcites →https://doi.org/10.2307/2282802openalex-snapshot
Structural Models: An Introduction to the Theory of Directed Graphs.
inferredcites →https://doi.org/10.2307/2314096openalex-snapshot
Structural Models: An Introduction to the Theory of Directed Graphs.
inferredcites →https://doi.org/10.2307/2322080openalex-snapshot
Discrete Mathematical Models with Applications to Social, Biological, and Environmental Problems.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4868474openalex-extracted
The M-Step Competition Number of Trees and Their Digraphs Construction
inferred← citeshttps://doi.org/10.1002/jgt.3190190308openalex-snapshot
Competitive inheritance and limitedness of graphs
inferred← citeshttps://doi.org/10.1007/978-1-4684-6381-1_1openalex-snapshot
Applications of Combinatorics and Graph Theory to the Biological and Social Sciences: Seven Fundamental Ideas
inferred← citeshttps://doi.org/10.1007/978-1-4684-6381-1_9openalex-snapshot
Food Webs, Competition Graphs, Competition-Common Enemy Graphs, and Niche Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-07956-1_7openalex-snapshot
Edge-Clique Covers of the Tensor Product
inferred← citeshttps://doi.org/10.1007/978-3-319-48532-4_22openalex-snapshot
On the Competition Numbers of Diamond-Free Graphs
inferred← citeshttps://doi.org/10.1007/bf01078980openalex-snapshot
Any complete preference structure without circuit admits an interval representation
inferred← citeshttps://doi.org/10.1007/bf01097528openalex-snapshot
Representations of graphs and networks (coding, layouts and embeddings)
inferred← citeshttps://doi.org/10.1007/s00373-012-1188-5openalex-snapshot
A Generalization of Opsut’s Lower Bounds for the Competition Number of a Graph
inferred← citeshttps://doi.org/10.1007/s00373-019-02023-4openalex-snapshot
Competition Numbers and Phylogeny Numbers: Uniform Complete Multipartite Graphs
inferred← citeshttps://doi.org/10.1007/s10878-010-9331-9openalex-snapshot
The competition number of a graph with exactly two holes
inferred← citeshttps://doi.org/10.1007/s13226-025-00893-4openalex-snapshot
A survey on the boxicity and cubicity of graphs
inferred← citeshttps://doi.org/10.1007/s40840-022-01338-5openalex-snapshot
Phylogeny Numbers of Generalized Hamming Graphs
inferred← citeshttps://doi.org/10.1016/0024-3795(94)00154-6openalex-snapshot
Loop and cyclic niche graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(83)90077-xopenalex-snapshot
Computing the boxicity of a graph by covering its complement by cointerval graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(83)90085-9openalex-snapshot
A characterization of competition graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(83)90086-0openalex-snapshot
A characterization of graphs of competition number m
inferred← citeshttps://doi.org/10.1016/0166-218x(83)90087-2openalex-snapshot
A characterization of competition graphs of arbitrary digraphs
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90061-7openalex-snapshot
Applications of edge coverings by cliques
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90030-8openalex-snapshot
The competition-common enemy graph of a digraph
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90007-yopenalex-snapshot
The double competition number of some triangle-free graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90002-eopenalex-snapshot
(i, j) competition graphs
inferred← citeshttps://doi.org/10.1016/j.aml.2010.12.009openalex-snapshot
The m -step competition graphs of doubly partial orders
inferred← citeshttps://doi.org/10.1016/j.aml.2011.03.003openalex-snapshot
Graphs having many holes but with small competition numbers
inferred← citeshttps://doi.org/10.1016/j.aml.2011.04.012openalex-snapshot
The competition numbers of ternary Hamming graphs
inferred← citeshttps://doi.org/10.1016/j.aml.2011.10.003openalex-snapshot
The competition number of a graph and the dimension of its hole space
inferred← citeshttps://doi.org/10.1016/j.dam.2004.06.010openalex-snapshot
Connected triangle-free m -step competition graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2005.02.005openalex-snapshot
A class of acyclic digraphs with interval competition graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2005.11.009openalex-snapshot
The elimination procedure for the competition number is not optimal
inferred← citeshttps://doi.org/10.1016/j.dam.2006.09.013openalex-snapshot
On CCE graphs of doubly partial orders
inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.009openalex-snapshot
The competition numbers of complete tripartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.11.004openalex-snapshot
The competition number of a graph with exactly h holes, all of which are independent
inferred← citeshttps://doi.org/10.1016/j.dam.2009.01.010openalex-snapshot
Note on the m-step competition numbers of paths and cycles
inferred← citeshttps://doi.org/10.1016/j.dam.2009.04.010openalex-snapshot
Characterizations of competition multigraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.09.007openalex-snapshot
An upper bound for the competition numbers of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.12.001openalex-snapshot
Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
inferred← citeshttps://doi.org/10.1016/j.dam.2010.04.004openalex-snapshot
The competition number of a graph whose holes do not overlap much
inferred← citeshttps://doi.org/10.1016/j.dam.2010.10.008openalex-snapshot
The (1,2) -step competition graph of a tournament
inferred← citeshttps://doi.org/10.1016/j.dam.2011.10.034openalex-snapshot
The competition number of the complement of a cycle
inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.017openalex-snapshot
The competition numbers of complete multipartite graphs with many partite sets
inferred← citeshttps://doi.org/10.1016/j.dam.2012.05.005openalex-snapshot
Competition numbers of complete r -partite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.05.009openalex-snapshot
On Opsut’s conjecture for hypercompetition numbers of hypergraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.05.024openalex-snapshot
The competition hypergraphs of doubly partial orders
inferred← citeshttps://doi.org/10.1016/j.dam.2012.09.012openalex-snapshot
Transversals and competition numbers of complete multipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.10.014openalex-snapshot
A generalization of Opsut’s result on the competition numbers of line graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.12.013openalex-snapshot
The (1,2) -step competition graph of a pure local tournament that is not round decomposable
inferred← citeshttps://doi.org/10.1016/j.disc.2004.12.016openalex-snapshot
The competition number of a graph having exactly one hole
inferred← citeshttps://doi.org/10.1016/j.disc.2009.06.016openalex-snapshot
The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares
inferred← citeshttps://doi.org/10.1016/j.disc.2011.11.035openalex-snapshot
A sufficient condition for Kim’s conjecture on the competition numbers of graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.022openalex-snapshot
Edge-clique covers of the tensor product
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00333-7openalex-snapshot
Clique covering the edges of a locally cobipartite graph
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00214-6openalex-snapshot
The m-step competition graph of a digraph
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00026-7openalex-snapshot
Competition numbers of graphs with a small number of triangles
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00209-7openalex-snapshot
Phylogeny numbers for graphs with two triangles
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70396-0openalex-snapshot
The Competition Number and its Variants
inferred← citeshttps://doi.org/10.1098/rsos.260035openalex-snapshot
Using matrix analysis to understand competition in food webs and antimicrobial resistance networks
inferred← citeshttps://doi.org/10.1109/cdee.2010.88openalex-snapshot
Note on Two-f-Tolerance Competition Graphs
inferred← citeshttps://doi.org/10.1111/ele.12081openalex-snapshot
The dimensionality of ecological networks
inferred← citeshttps://doi.org/10.1111/jvs.12252openalex-snapshot
A model of plant community dynamics based on replacement networks
inferred← citeshttps://doi.org/10.1137/0603043openalex-snapshot
On the Computation of the Competition Number of a Graph
inferred← citeshttps://doi.org/10.1142/9789812799890_0008openalex-snapshot
SOME APPLICATIONS OF GRAPH THEORY
inferred← citeshttps://doi.org/10.1142/9789814299152_0012openalex-snapshot
The Contributions of F.R. McMorris to Discrete Mathematics and its Applications
inferred← citeshttps://doi.org/10.1142/s1005386720000073openalex-snapshot
Competition Numbers and Phylogeny Numbers of Connected Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.12677/aam.2026.152054openalex-snapshot
Edge Clique Cover Number of Graphs with Independence Number Two
inferred← citeshttps://doi.org/10.2139/ssrn.5928416openalex-snapshot
Line graphs as competition graphs of degree bounded digraphs
inferred← citeshttps://doi.org/10.3389/fevo.2025.1644458openalex-snapshot
Optimal control of Lantana camara: an entropy-based sustainable strategy
inferred← citeshttps://doi.org/10.4236/ojdm.2017.71002openalex-snapshot
Competition Numbers of a Kind of Pseudo-Halin Graphs
inferred← citeshttps://doi.org/10.4236/ojdm.2017.72006openalex-snapshot
Competition Numbers of Several Kinds of Triangulations of a Sphere
inferred← citeshttps://doi.org/10.48550/arxiv.0905.3954openalex-snapshot
The niche graphs of doubly partial orders
inferred← citeshttps://doi.org/10.48550/arxiv.1103.4341openalex-snapshot
Holes and a chordal cut in a graph
inferred← citeshttps://doi.org/10.48550/arxiv.1110.2933openalex-snapshot
Competition Numbers, Quasi-Line Graphs and Holes
inferred← citeshttps://doi.org/10.48550/arxiv.1308.2368openalex-snapshot
Bounds for the boxicity of Mycielski graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1602.04623openalex-snapshot
Competition numbers of planar graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1904.07420openalex-snapshot
The phylogeny number in the aspect of triangles and diamonds of a graph
inferred← citeshttps://doi.org/10.5772/intechopen.98986openalex-snapshot
On Average Distance of Neighborhood Graphs and Its Applications
inferred← citeshttps://doi.org/10.7155/jgaa.00123openalex-snapshot
A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.