Sciweavers

39 search results - page 1 / 8
» Adjacency posets of planar graphs
Sort
View
85
Voted
DM
2010
91views more  DM 2010»
15 years 1 months ago
Adjacency posets of planar graphs
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...
Stefan Felsner, Ching Man Li, William T. Trotter
88
Voted
CORR
2010
Springer
145views Education» more  CORR 2010»
15 years 1 months ago
CAT-generation of ideals
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...
Torsten Ueckerdt
90
Voted
DM
2010
131views more  DM 2010»
15 years 1 months ago
Planar graphs without adjacent cycles of length at most seven are 3-colorable
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...
Oleg V. Borodin, Mickaël Montassier, Andr&eac...
90
Voted
JACM
2002
93views more  JACM 2002»
15 years 23 days ago
Map graphs
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...
102
Voted
DM
2008
127views more  DM 2008»
15 years 1 months ago
An adjacency lemma for critical multigraphs
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...
David Cariolaro