Results 251 to 260 of about 18,159 (263)
Some of the next articles are maybe not open access.
Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs
Discrete and Computational Geometry, 2010Thérèse Biedl, Biedl Thérèse
exaly
On the pagenumber of planar graphs
Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84, 1984Jonathan F. Buss, Peter W. Shor
openaire +1 more source
Planar graphs with girth at least 5 are (3,5)-colorable
Discrete Mathematics, 2015Ilkyoo Choi, André Raspaud
exaly
Planar graphs without cycles of length from 4 to 7 are 3-colorable
Journal of Combinatorial Theory Series B, 2005A Raspaud, O V Borodin
exaly
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
Discrete Mathematics, 2009Weifan Wang, Yuehua Bu, Yingqian Wang
exaly
Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
Discrete Mathematics, 2019Gexin Yu
exaly
Hard coloring problems in low degree planar bipartite graphs
Discrete Applied Mathematics, 2006Miroslav Chlebík, Janka Chlebíková
exaly
Optimal branch-decomposition of planar graphs in O ( n 3 ) Time
ACM Transactions on Algorithms, 2008Hisao Tamaki, Qian-Ping Gu
exaly
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98, 1998
Zhi-Zhong Chen +2 more
openaire +1 more source
Zhi-Zhong Chen +2 more
openaire +1 more source

