Titlebook: ;

MUTED

Fan-Planar Graphs: Combinatorial Properties and Complexity Resultsthe combinatorial and the algorithmic point of view. We prove tight bounds on the density of constrained versions of fan-planar drawings and study the relationship between fan-planarity and .-planarity. Also, we prove that testing fan-planarity in the variable embedding setting is NP-complete.

慟哭

Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidthhe 2-page crossing number is fixed-parameter tractable with respect to the sum of the number of crossings and the treewidth of the input graph. We prove these results via Courcelle’s theorem on the fixed-parameter tractability of properties expressible in monadic second order logic for graphs of bounded treewidth.

Hemiparesis

R. E. A. Standaert De Metsenaereion. We show that (i) every pair of partitions has a weak simultaneous embedding, (ii) it is .-complete to decide the existence of a strong simultaneous embedding, and (iii) the existence of a full simultaneous embedding can be tested in linear time.

陪審團(tuán)

Simultaneous Embeddability of Two Partitionsion. We show that (i) every pair of partitions has a weak simultaneous embedding, (ii) it is .-complete to decide the existence of a strong simultaneous embedding, and (iii) the existence of a full simultaneous embedding can be tested in linear time.

fetter

A. Gillner,M. Wehner,D. Hellrung,R. Popraweon graph, using a novel branch-and-bound procedure applied to a space decomposition of the color gamut. We conduct a user study to establish the effectiveness and limitations of this approach in clarifying drawings of real world graphs and maps

使閉塞

S. Devasenathipathy,J.G. SantiagoAdditionally, we show that subgraphs of the triangular grid admit a UPCR with cubes, implying that the same holds for each subgraph of an Archimedean grid. Considering further polygons, we construct UPCR with regular 3.-gons of the hexagonal grid and UPCR with regular 4.-gons of the square grid.

的染料

Hyperlipidemia

Microscopic Techniques for the Non-Expertmber of outerplanar graphs (CGTA, 2014). We also show that .(Δ.) slopes suffice to construct a crossing-free straight-line drawing of .; the best known upper bound on the planar slope number of planar partial 3-trees of bounded degree Δ is .(Δ.) and is proved by Jelínek . (Graphs and Combinatorics, 2013).

CLOUT

https://doi.org/10.1007/978-1-349-15601-6 polynomial-time algorithm to test whether a given graph is .. The algorithm can also be employed to produce an outer-fan-planar embedding, if one exists. On the negative side, we show that testing fan-planarity of a graph is NP-hard, for the case where the . (i.e., the cyclic order of the edges around each vertex) is given.

敘述