The Rique-number of graphs
From MaRDI portal
Publication:6117081
DOI10.1007/978-3-031-22203-0_27arXiv2209.00424MaRDI QIDQ6117081
Stefan Felsner, Michael A. Bekos, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter
Publication date: 16 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.00424
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-page book embeddings of 4-planar graphs
- Graph layouts via layered separators
- Graph minors. I. Excluding a forest
- Embedding planar graphs in four pages
- The book thickness of a graph
- Track layouts, layered path decompositions, and leveled planarity
- A left-first search algorithm for planar graphs
- On the queue number of planar graphs
- The mixed page number of graphs
- Embedding planar 5-graphs in three pages
- Hamiltonian circuits in simplicial complexes
- Extension of a theorem of Whitney
- The Book Embedding Problem from a SAT-Solving Perspective
- Stack and Queue Layouts via Layered Separators
- The bandwidth problem for graphs and matrices—a survey
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Data Structures and their Planar Graph Layouts
- Halin graphs and the travelling salesman problem
- Four pages are indeed necessary for planar graphs
- Planar Graphs Have Bounded Queue-Number
- Optimal Linear Ordering
- On the Queue Number of Planar Graphs
- Queue layouts of planar 3-trees
- Stack and queue number of 2-trees
- The Rique-number of graphs
This page was built for publication: The Rique-number of graphs
