Forbidden patterns in mixed linear layouts

Cites work

2-Layer Graph Drawings with Bounded Pathwidth
2-Layer k-Planar Graphs
2-layer right angle crossing drawings
A left-first search algorithm for planar graphs
A Sublinear Bound on the Page Number of Upward Planar Graphs
A triangle-free circle graph with chromatic number 5
Almost all permutation matrices have bounded saturation functions
An improved bound on the one-sided minimum crossing number in two-layered drawings
An improved upper bound on the queue number of planar graphs
Bounded-degree graphs have arbitrarily large queue-number
Circle graphs are quadratically χ‐bounded
Coloring circle graphs
Covering and coloring polygon-circle graphs
Crossing-free acyclic Hamiltonian path completion for planar \(st\)-digraphs
Davenport-Schinzel theory of matrices
Directed acyclic outerplanar graphs have constant stack number
Drawing graphs in two layers
Drawing Graphs on Two and Three Lines
Edge crossings in drawings of bipartite graphs
Embedding planar graphs in four pages
Excluded permutation matrices and the Stanley-Wilf conjecture
EXTREMAL THEORY OF ORDERED GRAPHS
Fast RSK correspondence by doubling search
Forbidden paths and cycles in ordered graphs and matrices
Four pages are indeed necessary for planar graphs
Genus g Graphs Have Pagenumber O(√g)
scientific article; zbMATH DE number 4051024 (Why is no real title available?)
scientific article; zbMATH DE number 4108789 (Why is no real title available?)
scientific article; zbMATH DE number 3499787 (Why is no real title available?)
scientific article; zbMATH DE number 398966 (Why is no real title available?)
scientific article; zbMATH DE number 1016990 (Why is no real title available?)
scientific article; zbMATH DE number 2159644 (Why is no real title available?)
scientific article; zbMATH DE number 2159655 (Why is no real title available?)
Improved bounds for colouring circle graphs
Laying Out Graphs Using Queues
Lazy queue layouts of posets
Linear layouts of bipartite planar graphs
Matrix partitions of perfect graphs
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
Mixed linear layouts of planar graphs
Mixed linear layouts: complexity, heuristics, and experiments
On 0-1 matrices and small excluded submatrices
On families of planar DAGs with constant stack number
On mixed linear layouts of series-parallel graphs
On the chromatic number of multiple interval graphs and overlap graphs
On the page number of upward planar directed acyclic graphs
On the queue-number of partial orders
On the upward book thickness problem: combinatorial and complexity results
Ordered sets, pagenumbers and planarity
Partitioning permutations into increasing and decreasing subsequences
Partitioning permutations into monotone subsequences
PATHWIDTH AND LAYERED DRAWINGS OF TREES
Planar graphs have bounded queue-number
Planar graphs of bounded degree have bounded queue number
Planar graphs that need four pages
Queue layouts of planar 3-trees
Queue layouts of two-dimensional posets
Shallow Minors, Graph Products, and Beyond-Planar Graphs
Some partitions associated with a partially ordered set
Stack and Queue Layouts of Directed Acyclic Graphs: Part I
Stacks, queues and tracks: layouts of graph subdivisions
The book thickness of 1-planar graphs is constant
The book thickness of a graph
The Complexity of Coloring Circular Arcs and Chords
The complexity of colouring circle graphs (extended abstract)
The mixed page number of graphs
The pagenumber of k-trees is O(k)
The pagenumber of genus g graphs is O( g )
The queue-number of posets of bounded width or height
Tight general bounds for the extremal numbers of 0-1 matrices
Track layouts, layered path decompositions, and leveled planarity
Two results on layered pathwidth and linear layouts
Upward book embeddability of \(st\)-graphs: complexity and algorithms

This page was built for publication: Forbidden patterns in mixed linear layouts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7287782)