Results 301 to 309 of about 27,053 (309)

An O ( n log n ) approximation scheme for Steiner tree in planar graphs

ACM Transactions on Algorithms, 2009
Glencora Borradaile, Philip Klein
exaly  

The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3

Journal of the ACM, 2019
Sandra Kiefer, Ilia Ponomarenko
exaly  

Interval-valued fuzzy planar graphs

International Journal of Machine Learning and Cybernetics, 2014
Tarasankar Pramanik, Sovan Samanta, Madhumangal Pal   +2 more
exaly  

Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable

Discrete Mathematics, 2019
Gexin Yu
exaly  

On the pagenumber of planar graphs

Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84, 1984
Jonathan F. Buss, Peter W. Shor
openaire   +1 more source

Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable

Journal of Combinatorial Theory Series B, 2009
O V Borodin, A Raspaud
exaly  

Planar graphs with girth at least 5 are (3,5)-colorable

Discrete Mathematics, 2015
Ilkyoo Choi, André Raspaud
exaly  

ExtremalC4-Free/C5-Free Planar Graphs

Journal of Graph Theory, 2016
exaly  

On floorplans of planar graphs

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97, 1997
openaire   +1 more source