[PDF][PDF] Various properties of various ultrafilters, various graph width parameters, and various connectivity systems

T Fujita - arXiv preprint arXiv, 2024 - researchgate.net
This paper investigates ultrafilters in the context of connectivity systems, defined as pairs (X,
f) where X is a finite set and f is a symmetric submodular function. Ultrafilters, essential in …

[图书][B] Sparsity: graphs, structures, and algorithms

J Nešetřil, PO De Mendez - 2012 - books.google.com
This is the first book devoted to the systematic study of sparse graphs and sparse finite
structures. Although the notion of sparsity appears in various contexts and is a typical …

[图书][B] Handbook of graph drawing and visualization

R Tamassia - 2013 - books.google.com
Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …

Planar graphs have bounded queue-number

V Dujmović, G Joret, P Micek, P Morin… - Journal of the ACM …, 2020 - dl.acm.org
We show that planar graphs have bounded queue-number, thus proving a conjecture of
Heath et al.[66] from 1992. The key to the proof is a new structural tool called layered …

Stack-number is not bounded by queue-number

V Dujmović, D Eppstein, R Hickingbotham, P Morin… - Combinatorica, 2022 - Springer
Stack-number is not bounded by queue-number Page 1 COMBINATORICA Bolyai Society –
Springer-Verlag 0209–9683/122/$6.00 c 2022 János Bolyai Mathematical Society and …

Layout of graphs with bounded tree-width

V Dujmovic, P Morin, DR Wood - SIAM Journal on Computing, 2005 - SIAM
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges
into queues, such that no two edges in the same queue are nested. The minimum number of …

[HTML][HTML] Layered separators in minor-closed graph classes with applications

V Dujmović, P Morin, DR Wood - Journal of Combinatorial Theory, Series B, 2017 - Elsevier
Graph separators are a ubiquitous tool in graph theory and computer science. However, in
some applications, their usefulness is limited by the fact that the separator can be as large …

[HTML][HTML] Characterisations and examples of graph classes with bounded expansion

J Nešetřil, PO de Mendez, DR Wood - European Journal of Combinatorics, 2012 - Elsevier
Classes with bounded expansion, which generalise classes that exclude a topological
minor, have recently been introduced by Nešetřil and Ossona de Mendez. These classes …

Stacks, queues and tracks: Layouts of graph subdivisions

V Dujmović, DR Wood - Discrete Mathematics & Theoretical …, 2005 - dmtcs.episciences.org
A\emphk-stack layout (respectively,\emphk-queuelayout) of a graph consists of a total order
of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges …

Queue layouts of planar 3-trees

JM Alam, MA Bekos, M Gronemann, M Kaufmann… - Algorithmica, 2020 - Springer
A queue layout of a graph G consists of a linear order of the vertices of G and a partition of
the edges of G into queues, so that no two independent edges of the same queue are …