Results 301 to 310 of about 38,199 (317)

Every Planar Graph with Maximum Degree 7 Is of Class 1

Graphs and Combinatorics, 2000
Limin Zhang
exaly  

Planar map graphs

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98, 1998
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou   +2 more
openaire   +1 more source

Gracker: A Graph-Based Planar Object Tracker

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2018
Tao Wang, Haibin Ling
exaly  

When a zero-divisor graph is planar or a complete r-partite graph

Journal of Algebra, 2003
S Akbari, H R Maimani, S Yassemi
exaly  

Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable

Discrete Mathematics, 2019
Xiangwen Li
exaly  

A sufficient condition for a planar graph to be 3-choosable

Information Processing Letters, 2007
Liang Shen, Yingqian Wang
exaly  

A sufficient condition for a planar graph to be 4-choosable

Discrete Applied Mathematics, 2017
Renyu Xu, Jianliang Wu
exaly  

Morphing planar graphs

Proceedings of the twentieth annual symposium on Computational geometry, 2004
Cesim Erten, Stephen G. Kobourov, Chandan Pitta   +2 more
openaire   +1 more source

Parameterized complexity: exponential speed-up for planar graph problems

Journal of Algorithms, 2004
Jochen Alber, Henning Fernau, Rolf Niedermeier   +2 more
exaly  

A sufficient condition for a planar graph to be class 1

Theoretical Computer Science, 2007
Weifan Wang
exaly