Add to ORKGAbstract. Over the last 30 years, researchers have investigated connections between dimension for posets and planarity for graphs. Here we extend this line of research to the structural graph theory parameter tree-width by proving that the dimension of a finite poset is bounded in terms of its height and the tree-width of its cover graph. 1
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
This article presents an algorithm which computes the dimension of an arbitrary finite poset (partia...
In 1977, Trotter and Moore proved that a poset has dimension at most 3 whenever its cover graph is a...
Abstract. In 1977, Trotter and Moore proved that a poset has dimension at most 3 whenever its cover ...
In 1977, Trotter and Moore proved that a poset has dimension at most 3 whenever its cover graph is a...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
In 1977, Trotter and Moore proved that a poset has dimension at most 3 whenever its cover graph is a...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
if there exists a constant d such that if P is a poset with cover graph of P of pathwidth at most 2,...
Proceedings of Graph Theory@Georgia Tech, a conference honoring the 50th Birthday of Robin Thomas, M...
The goal of this dissertation is to study the various connections between the dimension of posets an...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
This article presents an algorithm which computes the dimension of an arbitrary finite poset (partia...
In 1977, Trotter and Moore proved that a poset has dimension at most 3 whenever its cover graph is a...
Abstract. In 1977, Trotter and Moore proved that a poset has dimension at most 3 whenever its cover ...
In 1977, Trotter and Moore proved that a poset has dimension at most 3 whenever its cover graph is a...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
In 1977, Trotter and Moore proved that a poset has dimension at most 3 whenever its cover graph is a...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
if there exists a constant d such that if P is a poset with cover graph of P of pathwidth at most 2,...
Proceedings of Graph Theory@Georgia Tech, a conference honoring the 50th Birthday of Robin Thomas, M...
The goal of this dissertation is to study the various connections between the dimension of posets an...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
This article presents an algorithm which computes the dimension of an arbitrary finite poset (partia...