Stack-Number is Not Bounded by Queue-Number
نویسندگان
چکیده
We describe a family of graphs with queue-number at most 4 but unbounded stack-number. This resolves open problems Heath, Leighton and Rosenberg (1992) Blankenship Oporowski (1999).
منابع مشابه
Bounded-Degree Graphs have Arbitrarily Large Queue-Number
We consider graphs possibly with loops but with no parallel edges. A graph without loops is simple. Let G be a graph with vertex set V (G) and edge set E(G). If S ⊆ E(G) then G[S] denotes the spanning subgraph of G with edge set S. We say G is ordered if V (G) = {1, 2, . . . , |V (G)|}. Let G be an ordered graph. Let `(e) and r(e) denote the endpoints of each edge e ∈ E(G) such that `(e) ≤ r(e)...
متن کاملOn the Queue-Number of Graphs with Bounded Tree-Width
A queue layout of a graph consists of a linear order of the vertices and an assignment of the edges to queues, such that no two edges in a single queue are nested. The minimum number of queues needed in a queue layout of a graph is called its queue-number. We show that for each k > 0, graphs with tree-width at most k have queuenumber at most 2k − 1. This improves upon double exponential upper b...
متن کاملOdd Crossing Number Is Not Crossing Number
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the number of pairs of edges that intersect an odd number of times, we obtain the odd crossing number. We show that there is a graph for which these two concepts differ, answering a well-known open question on crossing numbe...
متن کاملAge is a number, not a group
1. Yaqub M, Ismail S, Babiker S, Sathyanarayana Rao TS. Psychiatrists’ responsibilities with regards to patients’ fitness to drive. Indian J Psychiatry 2016;58:287-90. 2. Roy S, Dasgupta A, Banerjee U, Chowdhury P, Mukhopadhyay A, Saha G, et al. Role of membrane cholesterol and lipid peroxidation in regulating the Na+/K+-ATPase activity in schizophrenia. Indian J Psychiatry 2016;58:317-25. 3. G...
متن کاملOn the bounded domination number of tournaments
In a simple digraph, a star of degree t is a union of t edges with a common tail. The k-domination number k(G) of digraph G is the minimum number of stars of degree at most k needed to cover the vertex set. We prove that k(T )= dn=(k +1)e when T is a tournament with n¿14k lg k vertices. This improves a result of Chen, Lu and West. We also give a short direct proof of the result of E. Szekeres a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2021
ISSN: ['0209-9683', '1439-6912']
DOI: https://doi.org/10.1007/s00493-021-4585-7