New conjectures for outer thickness and arboricity of a graph

outer planar graphs are a widely studied graph class with application in graphdrawing [1,2] and with intersecting theoretical properties [3,4,5] .A graph is outer planer if it admits a plane embedding where all its vertices surround the same region and no two distinct edge intersect , otherwise the graph is non outer planer .Since is approximately and is approximately , it seems that the constant is not the best possible , others [10] conjecture the following upper bound for outer thickness ( ) but we show that new conjectures for outer thickness andarboricity of a graph.

کلیدواژه ها:

Outer planar ، outer thickness ، arboricity