Planarity and Edge Poset Dimension
Planarity and Edge Poset Dimension
复制标题
DOI:
10.1006/eujc.1996.0064
复制
发表时间:
1996-11
期刊:
影响因子:
--
通讯作者:
H. D. Fraysseix;P. D. Mendez
中科院分区:
文献类型:
--
作者:
H. D. Fraysseix;P. D. Mendez
Abstract Different areas of discrete mathematics lead to instrinsically different characterizations of planar graphs. Planarity is expressed in terms of topology, combinatorics, algebra or search trees. More recently, Schnyder's work has related planarity to partial order theory. Acyclic orientations and associated edge partial orders lead to a new characterization of planar graphs, which also describes all of the possible planar embeddings. We prove here that there is a bijection between bipolar plane digraphs and 2-dimensional N- free partial orders. We give also a characterization of planarity in terms of 2-colorability of a graph and provide a short proof of a previous result on planar lattices.