Jan 16, 2018 · Thus, the stub resolution of a drawing is defined as the minimum ratio between the length of a stub and the length of the entire edge containing ...
Bounded Stub Resolution for Some Maximal 1-Planar Graphs ...
www.semanticscholar.org › paper › Bou...
In an attempt to prove the conjecture that the stub resolution of 1-planar graphs is bounded, this work closely investigates a class of maximal 1-Planar ...
Bounded stub resolution for some maximal 1-planar graphs. In B. Panda and P. Goswami, editors, CALDAM 2018, volume 10743 of LNCS, pages 214–220. Springer ...
... In this paper we investigate a recent criterion for nonplanar drawings, called stub resolution [33] . Intersection points divide edges into parts, called ...
Bounded Stub Resolution for Some Maximal 1-Planar Graphs ... Authors: Michael Kaufmann; Jan Kratochvíl; Fabian Lipp; Fabrizio Montecchiani; Chrysanthi Raftopoulou ...
Dec 27, 2022 · Bibliographic details on Bounded Stub Resolution for Some Maximal 1-Planar Graphs.
In an attempt to prove the conjecture that the stub resolution of 1-planar graphs is bounded, we closely investigate a class of maximal 1-planar graphs arising ...
Article "Bounded Stub Resolution for Some Maximal 1-Planar Graphs" Detailed information of the J-GLOBAL is an information service managed by the Japan ...
Mar 31, 2020 · The stub resolution of a drawing is defined as the minimum ratio between the length of a stub and the length of the entire edge, over all the edges of the ...
In the above mentioned companion paper [2] we show that 1-planar graphs have 1-planar drawings with stub resolution bounded from below by a positive constant ...