In this paper, we show that the dimension of the adjacency poset of a planar graph is at most 8. From below, we show that there is a planar graph whose adjacency poset has dimensio...
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...
We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planar...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...