Pages that link to "Item:Q5133977"
From MaRDI portal
The following pages link to Planar Graphs Have Bounded Queue-Number (Q5133977):
Displaying 50 items.
- Notes on graph product structure theory (Q2058955) (← links)
- On mixed linear layouts of series-parallel graphs (Q2087464) (← links)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- Improved bounds for weak coloring numbers (Q2121806) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- Recognizing and embedding simple optimal 2-planar graphs (Q2151433) (← links)
- On the queue-number of partial orders (Q2151446) (← links)
- On the queue number of planar graphs (Q2151450) (← links)
- An improved planar graph product structure theorem (Q2152790) (← links)
- The mixed page number of graphs (Q2167907) (← links)
- On fractional fragility rates of graph classes (Q2205120) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
- A fast algorithm for the product structure of planar graphs (Q2663717) (← links)
- An improved upper bound on the queue number of planar graphs (Q2684487) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Plane Drawings of Queue and Deque Graphs (Q3073660) (← links)
- Quasi-planar Graphs (Q5001655) (← links)
- Edge Partitions and Visibility Representations of 1-planar Graphs (Q5001658) (← links)
- The Local Queue Number of Graphs with Bounded Treewidth (Q5014102) (← links)
- Parameterized Algorithms for Queue Layouts (Q5014103) (← links)
- Lazy Queue Layouts of Posets (Q5014104) (← links)
- On Mixed Linear Layouts of Series-Parallel Graphs (Q5014112) (← links)
- Twin-width II: small classes (Q5051371) (← links)
- Two Results on Layered Pathwidth and Linear Layouts (Q5144880) (← links)
- Improved Bounds for Centered Colorings (Q5162872) (← links)
- Planar Graphs of Bounded Degree Have Bounded Queue Number (Q5235482) (← links)
- On the Queue Number of Planar Graphs (Q5408766) (← links)
- Shorter Labeling Schemes for Planar Graphs (Q5866447) (← links)
- Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)
- Note on strong product graph dimension (Q5888906) (← links)
- Separating layered treewidth and row treewidth (Q6045398) (← links)
- Improved product structure for graphs on surfaces (Q6045446) (← links)
- Sparse universal graphs for planarity (Q6085077) (← links)
- Shallow Minors, Graph Products, and Beyond-Planar Graphs (Q6130539) (← links)
- Packing topological minors half‐integrally (Q6134535) (← links)
- The product structure of squaregraphs (Q6143380) (← links)
- Graph product structure for non-minor-closed classes (Q6170788) (← links)
- Recognizing map graphs of bounded treewidth (Q6182682) (← links)
- Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete (Q6547943) (← links)
- On families of planar DAGs with constant stack number (Q6560144) (← links)
- Product structure extension of the Alon-Seymour-Thomas theorem (Q6573005) (← links)
- Bounded-degree planar graphs do not have bounded-degree product structure (Q6574390) (← links)
- Colouring strong products (Q6612523) (← links)
- Product structure of graph classes with bounded treewidth (Q6630446) (← links)
- The excluded tree minor theorem revisited (Q6632794) (← links)
- Product structure of graph classes with bounded treewidth (Q6632809) (← links)
- Product structure of graphs with an excluded minor (Q6653803) (← links)
- Parameterizing path partitions (Q6664058) (← links)
- Graph product structure for \(h\)-framed graphs (Q6671588) (← links)
