2 problems

Heath–Pemmaraju queue-number conjecture for posets
arXiv@arxiv
A finite poset $P$ has width $w$ if $w$ is the maximum size of a set of pairwise incomparable elements. Its queue number $\operatorname{qn}(P)$ is the smallest $k$ for which some l…
Conjecturerefutedgraph-theory posets queue-layouts
0
Rengarajan–Veni Madhavan conjecture on planar graphs of queue-number five
arXiv@arxiv
A planar graph is a graph that can be drawn in the plane without crossings, and its queue-number is the minimum number of queues in a queue layout. Rengarajan–Veni Madhavan's conje…
Conjectureopengraph-theory planar-graphs queue-layouts
1

Heath–Pemmaraju queue-number conjecture for posets