magnanimity
发表于 2025-3-28 14:37:44
https://doi.org/10.1007/978-3-322-93200-6in the plane. Here, we address the dual graphs. Our main result is a combinatorial characterization of these sets of upward planar graphs. It basically shows that the roles of the standing and the rolling cylinders are interchanged for their duals.
LATER
发表于 2025-3-28 20:33:36
http://reply.papertrans.cn/39/3881/388022/388022_42.png
物质
发表于 2025-3-29 01:16:33
https://doi.org/10.1007/978-3-658-38171-4t least 2 and vertices in distance 2 get different labels. The main result of the paper is an algorithm finding an optimal .(2,1)-labeling of a graph (i.e. an .(2,1)-labeling in which the largest label is the least possible) in time ..(7.4922.) and polynomial space. Moreover, a new interesting extre
甜食
发表于 2025-3-29 03:30:55
http://reply.papertrans.cn/39/3881/388022/388022_44.png
种族被根除
发表于 2025-3-29 07:58:09
http://reply.papertrans.cn/39/3881/388022/388022_45.png
细节
发表于 2025-3-29 13:32:25
http://reply.papertrans.cn/39/3881/388022/388022_46.png
SMART
发表于 2025-3-29 17:11:53
http://reply.papertrans.cn/39/3881/388022/388022_47.png
maladorit
发表于 2025-3-29 22:43:02
Account on Intervalsnimum number of different interval lengths needed to represent a given interval graph. Whereas graphs of interval count 1 coincide with unit interval graphs, not much is known about graphs of interval count 2. In this talks we will survey some recent results and discuss several open problems related to interval count 2 graphs.
夹死提手势
发表于 2025-3-30 00:43:30
-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Arear specific sub-families of partial .-trees, we present ad-hoc algorithms that compute .-quasi planar drawings in linear area, such that . is significantly reduced with respect to the general result. Finally, we compare the notion of .-quasi planarity with the notion of .-planarity, where each edge is allowed to be crossed at most . times.
palette
发表于 2025-3-30 04:02:02
On the Stable Degree of Graphsgree is hard to approximate. For asteroidal triple-free graphs and graphs of bounded asteroidal number the stable degree can be computed in polynomial time. For graphs in these classes the treewidth is bounded from below and above in terms of the stable degree.