scholarly journals Flow in planar graphs with vertex capacities

Algorithmica ◽  
1994 ◽  
Vol 11 (3) ◽  
pp. 200-225 ◽  
Author(s):  
Samir Khuller ◽  
Joseph (Seffi) Naor
Keyword(s):  
Planar Graphs ◽  
Vertex Capacities

scholarly journals Maximum Flow in Directed Planar Graphs with Vertex Capacities

Algorithmica ◽  
2010 ◽  
Vol 61 (1) ◽  
pp. 174-189 ◽  
Author(s):  
Haim Kaplan ◽  
Yahav Nussbaum
Keyword(s):  
Planar Graphs ◽  
Maximum Flow ◽  
Vertex Capacities

scholarly journals Maximum Flow in Directed Planar Graphs with Vertex Capacities

2009 ◽  
pp. 397-407 ◽  
Author(s):  
Haim Kaplan ◽  
Yahav Nussbaum
Keyword(s):  
Planar Graphs ◽  
Maximum Flow ◽  
Vertex Capacities

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

scholarly journals Maximal distance spectral radius of 4-chromatic planar graphs

2021 ◽  
Vol 618 ◽  
pp. 183-202
Author(s):  
Aysel Erey
Keyword(s):  
Spectral Radius ◽  
Planar Graphs ◽  
Maximal Distance

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

scholarly journals Clustered 3-colouring graphs of bounded degree

2021 ◽  
pp. 1-13
Author(s):  
Vida Dujmović ◽  
Louis Esperet ◽  
Pat Morin ◽  
Bartosz Walczak ◽  
David R. Wood
Keyword(s):  
Planar Graphs ◽  
Maximum Degree ◽  
Bounded Degree ◽  
Bounded Number ◽  
Proper Vertex ◽  
Vertex Colouring

Abstract A (not necessarily proper) vertex colouring of a graph has clustering c if every monochromatic component has at most c vertices. We prove that planar graphs with maximum degree $\Delta$ are 3-colourable with clustering $O(\Delta^2)$ . The previous best bound was $O(\Delta^{37})$ . This result for planar graphs generalises to graphs that can be drawn on a surface of bounded Euler genus with a bounded number of crossings per edge. We then prove that graphs with maximum degree $\Delta$ that exclude a fixed minor are 3-colourable with clustering $O(\Delta^5)$ . The best previous bound for this result was exponential in $\Delta$ .

Structure and pancyclicity of maximal planar graphs with diameter two

2021 ◽  
Author(s):  
Shu-Yu Cui ◽  
Yiqiao Wang ◽  
Danjun Huang ◽  
Hongwei Du ◽  
Weifan Wang
Keyword(s):  
Planar Graphs
Sign in / Sign up

Export Citation Format

Share Document