On the (3,1)-choosability of planar graphs without adjacent cycles of length 5,6,7

2019 ◽  
Vol 342 (6) ◽  
pp. 1782-1791
Author(s):  
Yue Wang ◽  
Jianliang Wu ◽  
Donglei Yang
Keyword(s):  
Planar Graphs ◽  
Adjacent Cycles

scholarly journals Planar graphs without adjacent cycles of length at most five are (1,1,0) -colorable

2016 ◽  
Vol 339 (12) ◽  
pp. 3032-3042 ◽  
Author(s):  
Chuanni Zhang ◽  
Yingqian Wang ◽  
Min Chen
Keyword(s):  
Planar Graphs ◽  
Adjacent Cycles

DP-4-colorability of planar graphs without adjacent cycles of given length

2020 ◽  
Vol 277 ◽  
pp. 245-251 ◽  
Author(s):  
Runrun Liu ◽  
Xiangwen Li ◽  
Kittikorn Nakprasit ◽  
Pongpat Sittitrai ◽  
Gexin Yu
Keyword(s):  
Planar Graphs ◽  
Adjacent Cycles

scholarly journals Planar graphs without adjacent cycles of length at most seven are 3-colorable

2010 ◽  
Vol 310 (1) ◽  
pp. 167-173 ◽  
Author(s):  
Oleg V. Borodin ◽  
Mickael Montassier ◽  
André Raspaud
Keyword(s):  
Planar Graphs ◽  
Adjacent Cycles

Acute Constraints in Straight-Line Drawings of Planar Graphs

2019 ◽  
Vol E102.A (9) ◽  
pp. 994-1001
Author(s):  
Akane SETO ◽  
Aleksandar SHURBEVSKI ◽  
Hiroshi NAGAMOCHI ◽  
Peter EADES
Keyword(s):  
Planar Graphs ◽  
Line Drawings ◽  
Straight Line

A Space-Efficient Separator Algorithm for Planar Graphs

2019 ◽  
Vol E102.A (9) ◽  
pp. 1007-1016 ◽  
Author(s):  
Ryo ASHIDA ◽  
Sebastian KUHNERT ◽  
Osamu WATANABE
Keyword(s):  
Planar Graphs

Note on (semi-)proper orientation of some triangulated planar graphs

2021 ◽  
Vol 392 ◽  
pp. 125723
Author(s):  
Ruijuan Gu ◽  
Hui Lei ◽  
Yulai Ma ◽  
Zhenyu Taoqiu
Keyword(s):  
Planar Graphs ◽  
Proper Orientation

scholarly journals Distributed Dominating Set Approximations beyond Planar Graphs

2019 ◽  
Vol 15 (3) ◽  
pp. 1-18 ◽  
Author(s):  
Saeed Akhoondian Amiri ◽  
Stefan Schmid ◽  
Sebastian Siebertz
Keyword(s):  
Planar Graphs ◽  
Dominating Set
Sign in / Sign up

Export Citation Format

Share Document