Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
From MaRDI portal
Publication:968201
DOI10.1016/j.dam.2009.12.001zbMath1225.05188OpenAlexW2010464832MaRDI QIDQ968201
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.12.001
trapezoid graphinterval graphintersection numberfood webcompetition graph of a digraphdouble competition graph
Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
On the competition graphs of \(d\)-partial orders, Niche hypergraphs, The \(m\)-step competition graphs of doubly partial orders, The partial order competition dimensions of bipartite graphs, The competition hypergraphs of doubly partial orders, A generalization of Opsut's result on the competition numbers of line graphs, The double competition hypergraph of a digraph, A graph with the partial order competition dimension greater than five, Competition numbers and phylogeny numbers: uniform complete multipartite graphs, On the partial order competition dimensions of chordal graphs, Phylogeny numbers of generalized Hamming graphs
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the boxicity of a graph by covering its complement by cointerval graphs
- The double competition number of some triangle-free graphs
- Upper bound multigraphs for posets
- Applications of edge coverings by cliques
- On CCE graphs of doubly partial orders
- Recognizing edge clique graphs among interval graphs and probe interval graphs
- Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two
- Localized and compact data-structure for comparability graphs
- Some uniqueness results for upper bound graphs
- A characterization of competition graphs
- A characterization of graphs of competition number m
- The competition-common enemy graph of a digraph
- Posets with interval upper bound graphs
- Trapezoid graphs and their coloring
- On the Ferrers dimension of a digraph
- A characteristic property of labelings and linear extensions of posets of dimension 2
- Geometric containment orders: A survey
- A special planar satisfiability problem and a consequence of its NP- completeness
- On the double competition number
- On upper bound graphs with respect to unary operations on graphs
- On upper bound graphs with respect to operations on graphs
- A class of acyclic digraphs with interval competition graphs
- Intransitive indifference with unequal indifference intervals
- Boxicity and treewidth
- The Complexity of the Partial Order Dimension Problem
- Topics in Intersection Graph Theory
- Tolerance graphs, and orders
- Graph Classes: A Survey
- Competition Graphs of Hamiltonian Digraphs
- On the Computation of the Competition Number of a Graph
- A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
- The Representation of a Graph by Set Intersections
- A Characterization of Comparability Graphs and of Interval Graphs
- On transformations of posets which have the same bound graph
