Results 1 
8 of
8
Posets and planar graphs
 JOURNAL OF GRAPH THEORY
, 2000
"... Usually dimension should be an integer valued parameter, we introduce a refined version of dimension for graphs which can assume a value [t − 1 ↕t] which is thought to be between t − 1 and t. We have the following two results: • A graph is outerplanar if and only if its dimension is at most [2↕3]. ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
Usually dimension should be an integer valued parameter, we introduce a refined version of dimension for graphs which can assume a value [t − 1 ↕t] which is thought to be between t − 1 and t. We have the following two results: • A graph is outerplanar if and only if its dimension is at most [2↕3]. This characterization of outerplanar graphs is closely related to the celebrated result of W. Schnyder [16] who proved that a graph is planar if and only if its dimension is at most 3. • The largest n for which the dimension of the complete graph Kn is at most [t − 1↕t] is the number of antichains in the lattice of all subsets of a set of size t − 2. Accordingly, the refined dimension problem for complete graphs is equivalent to the classical combinatorial problem known as Dedekind’s problem. This result extends work of Ho¸sten and Morris [14]. The main results are enriched by background material which links to a line of reserch in extremal graph theory which was stimulated by a problem posed by G. Agnarsson: Find the maximum number of edges in a graph on n nodes with dimension at most t.
D.: Graph products revisited: Tight approximation hardness of induced matching, poset dimension and
, 2013
"... Graph product is a fundamental tool with rich applications in both graph theory and theoretical computer science. It is usually studied in the form f(G∗H) where G and H are graphs, ∗ is a graph product and f is a graph property. For example, if f is the independence number and ∗ is the disjunctive ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Graph product is a fundamental tool with rich applications in both graph theory and theoretical computer science. It is usually studied in the form f(G∗H) where G and H are graphs, ∗ is a graph product and f is a graph property. For example, if f is the independence number and ∗ is the disjunctive product, then the product is known to be multiplicative: f(G∗H) = f(G)f(H). In this paper, we study graph products in the following nonstandard form: f((G⊕H) ∗ J) where G, H and J are graphs, ⊕ and ∗ are two different graph products and f is a graph property. We show that if f is the induced and semiinduced matching number, then for some products ⊕ and ∗, it is subadditive in the sense that f((G ⊕ H) ∗ J) ≤ f(G ∗ J) + f(H ∗ J). Moreover, when f is the poset dimension number, it is almost subadditive. As applications of this result (we only need J = K2 here), we obtain tight hardness of approximation for various problems in discrete mathematics and computer science: bipartite induced and semiinduced matching (a.k.a. maximum expanding sequences), poset dimension, maximum feasible subsystem with 0/1 coefficients, unitdemand minbuying and singleminded pricing, donation center location, boxicity, cubicity, threshold dimension and independent packing. 1
THE DIMENSION OF POSETS WITH PLANAR COVER GRAPHS
"... Abstract. Kelly showed that there exist planar posets of arbitrarily large dimension, and Streib and Trotter showed that the dimension of a poset with a planar cover graph is bounded in terms of its height. Here we continue the study of conditions that bound the dimension of posets with planar cover ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Kelly showed that there exist planar posets of arbitrarily large dimension, and Streib and Trotter showed that the dimension of a poset with a planar cover graph is bounded in terms of its height. Here we continue the study of conditions that bound the dimension of posets with planar cover graphs. We show that if P is poset with a planar comparability graph, then the dimension of P is at most four. We also show that if P has an outerplanar cover graph, then the dimension of P is at most four. Finally, if P has an outerplanar cover graph and the height of P is two, then the dimension of P is at most three. These three inequalities are all best possible. 1.
The Order Dimension of Planar Maps Revisited
"... Abstract. Schnyder characterized planar graphs in terms of order dimension. This seminal result found several extensions. A particularly far reaching extension is the BrightwellTrotter Theorem about planar maps. It states that the order dimension of the incidence poset PM of vertices, edges and fac ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Schnyder characterized planar graphs in terms of order dimension. This seminal result found several extensions. A particularly far reaching extension is the BrightwellTrotter Theorem about planar maps. It states that the order dimension of the incidence poset PM of vertices, edges and faces of a planar map M has dimension at most 4. The original proof generalizes the machinery of Schnyderpaths and Schnyderregions. In this note we use a simple result about the order dimension of grid intersection graphs to show a slightly stronger result: dim(split(PM)) ≤ 4. This may be the first result in the area that is obtained without using the tools introduced by Schnyder.
Treewidth and dimension
 Combinatorica
"... Abstract. 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 treewidth by proving that the dimension of a finite poset is bounded in terms of its heigh ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. 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 treewidth by proving that the dimension of a finite poset is bounded in terms of its height and the treewidth of its cover graph. 1.
DIMENSION AND STRUCTURE FOR A POSET OF GRAPH MINORS
, 2010
"... Given a graph G with labeled vertices, define MP(G), the labeled minorposet of G, to be the poset whose elements are the minors of G with G1 ≤ G2 if and only if G1 ≼ G2. In this paper we study the dimension this poset, which is a minormonotone graph parameter. We provide important structural resu ..."
Abstract
 Add to MetaCart
Given a graph G with labeled vertices, define MP(G), the labeled minorposet of G, to be the poset whose elements are the minors of G with G1 ≤ G2 if and only if G1 ≼ G2. In this paper we study the dimension this poset, which is a minormonotone graph parameter. We provide important structural results which yield nontrivial bounds on this parameter for cycles, complete graphs, trees, and the minorclosed class of graphs which exclude K2,4minors. We also state a conjecture that characterizes of the class of K2,tminor free graphs. Lastly, we consider two multigraph models and provide direction for future research.