Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
type: Item
instance of: scholarly article
title: Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
zbMATH Open document ID: 1225.05188
author: Yaokun Wu
author: Junjie Lu
published in: Discrete Applied Mathematics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 5703775
zbMATH Keywords: competition graph of a digraph
zbMATH Keywords: double competition graph
zbMATH Keywords: food web
zbMATH Keywords: interval graph
zbMATH Keywords: intersection number
zbMATH Keywords: trapezoid graph
MaRDI profile type: Publication
full work available at URL: j.dam.2009.12.001
OpenAlex ID: W2010464832
cites work: A characteristic property of labelings and linear extensions of posets of dimension 2
cites work: Localized and compact data-structure for comparability graphs
cites work: Graph Classes: A Survey
cites work: Boxicity and treewidth
cites work: A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
cites work: A class of acyclic digraphs with interval competition graphs
cites work: On the Ferrers dimension of a digraph
cites work: Q4187859
cites work: Q3797233
cites work: Computing the boxicity of a graph by covering its complement by cointerval graphs
cites work: Trapezoid graphs and their coloring
cites work: A characterization of competition graphs
cites work: On upper bound graphs with respect to operations on graphs
cites work: On transformations of posets which have the same bound graph
cites work: On upper bound graphs with respect to unary operations on graphs
cites work: The Representation of a Graph by Set Intersections
cites work: Tolerance graphs, and orders
cites work: Q3344239
cites work: Intransitive indifference with unequal indifference intervals
cites work: Geometric containment orders: A survey
cites work: On the double competition number
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Q4828541
cites work: Competition Graphs of Hamiltonian Digraphs
cites work: Q3797197
cites work: On CCE graphs of doubly partial orders
cites work: Q3139771
cites work: Recognizing edge clique graphs among interval graphs and probe interval graphs
cites work: Q3575460
cites work: A special planar satisfiability problem and a consequence of its NP- completeness
cites work: Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two
cites work: Q3479858
cites work: A characterization of graphs of competition number m
cites work: Q5501778
cites work: Upper bound multigraphs for posets
cites work: Topics in Intersection Graph Theory
cites work: Some uniqueness results for upper bound graphs
cites work: Q3039403
cites work: On the Computation of the Competition Number of a Graph
cites work: Q3924236
cites work: Q3689222
cites work: Q5588433
cites work: Q4171826
cites work: Applications of edge coverings by cliques
cites work: Q4342025
cites work: Posets with interval upper bound graphs
cites work: The competition-common enemy graph of a digraph
cites work: The double competition number of some triangle-free graphs
cites work: Q4004146
cites work: The Complexity of the Partial Order Dimension Problem
DOI: 10.1016/J.DAM.2009.12.001
description: scientific article; zbMATH DE number 5703775