Graphs and AlgorithmsIt is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In particular, for all \Delta ≥ 3 and for all sufficiently large n, there is a simple \Delta-regular n-vertex graph with queue-number at least c√\Delta_n^{1/2-1/\Delta} for some absolute constant c
In this paper we study the size of the largest clique ω(G(n, α))in a random graph G(n, α) on n verti...
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the max...
In this paper, we study the order of a maximal clique in an amply regular graph with a fixed smalles...
It is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In par...
A queue layout of a graph consists of a linear order of its vertices and a partition of its edges in...
A class of countable infinite graphs with unbounded vertex degree is con-sidered. In these graphs, t...
In 1983, Chvatal, Trotter and the two senior authors proved that for any Delta there exists a consta...
The bandwidth theorem of Böttcher, Schacht, and Taraz [Proof of the bandwidth conjecture of Bollobás...
AbstractA conjecture of Richter and Salazar about graphs that are critical for a fixed crossing numb...
In this paper we prove the following conjecture by Bollobás and Komlós: For every γ > 0 and integers...
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges in...
In this thesis we are going to present some results on embedding spanning subgraphs into large dense...
The structure of all known infinite families of crossing–critical graphs has led to the conjecture t...
We show that the traveling salesman problem in bounded-degree graphs can be solved in time O((2 - ep...
We prove that for every > 0 and positive integer r, there exists ∆0 = ∆0() such that if ∆> ∆0 ...
In this paper we study the size of the largest clique ω(G(n, α))in a random graph G(n, α) on n verti...
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the max...
In this paper, we study the order of a maximal clique in an amply regular graph with a fixed smalles...
It is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In par...
A queue layout of a graph consists of a linear order of its vertices and a partition of its edges in...
A class of countable infinite graphs with unbounded vertex degree is con-sidered. In these graphs, t...
In 1983, Chvatal, Trotter and the two senior authors proved that for any Delta there exists a consta...
The bandwidth theorem of Böttcher, Schacht, and Taraz [Proof of the bandwidth conjecture of Bollobás...
AbstractA conjecture of Richter and Salazar about graphs that are critical for a fixed crossing numb...
In this paper we prove the following conjecture by Bollobás and Komlós: For every γ > 0 and integers...
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges in...
In this thesis we are going to present some results on embedding spanning subgraphs into large dense...
The structure of all known infinite families of crossing–critical graphs has led to the conjecture t...
We show that the traveling salesman problem in bounded-degree graphs can be solved in time O((2 - ep...
We prove that for every > 0 and positive integer r, there exists ∆0 = ∆0() such that if ∆> ∆0 ...
In this paper we study the size of the largest clique ω(G(n, α))in a random graph G(n, α) on n verti...
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the max...
In this paper, we study the order of a maximal clique in an amply regular graph with a fixed smalles...
DOI
Add to ORKG