Forbidden Patterns in Mixed Linear Layouts
Fuente:
arXiv
Saved in:
| Main Authors: | Haun, Deborah, Merker, Laura, Pupyrev, Sergey |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Product Structure and Treewidth of Hyperbolic Uniform Disk Graphs
by: Bläsius, Thomas, et al.
Published: (2026)
by: Bläsius, Thomas, et al.
Published: (2026)
Directed Acyclic Outerplanar Graphs Have Constant Stack Number
by: Jungeblut, Paul, et al.
Published: (2022)
by: Jungeblut, Paul, et al.
Published: (2022)
Three-dimensional graph products with unbounded stack-number
by: Eppstein, David, et al.
Published: (2022)
by: Eppstein, David, et al.
Published: (2022)
Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
by: Spirkl, Sophie, et al.
Published: (2026)
by: Spirkl, Sophie, et al.
Published: (2026)
Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)
by: Srinivasan, Eshwar, et al.
Published: (2025)
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
by: Lozin, Vadim, et al.
Published: (2022)
by: Lozin, Vadim, et al.
Published: (2022)
Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)
by: Srinivasan, Eshwar, et al.
Published: (2025)
Intersection Graphs with and without Product Structure
by: Merker, Laura, et al.
Published: (2024)
by: Merker, Laura, et al.
Published: (2024)
$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$
by: la Tour, Max Dupré, et al.
Published: (2024)
by: la Tour, Max Dupré, et al.
Published: (2024)
Computing random $r$-orthogonal Latin squares
by: Bereg, Sergey
Published: (2023)
by: Bereg, Sergey
Published: (2023)
Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025)
by: Hilaire, Claire, et al.
Published: (2025)
Exhaustive Generation of Pattern-Avoiding s-Words
by: Buick, Samuel, et al.
Published: (2025)
by: Buick, Samuel, et al.
Published: (2025)
On Patterns and Languages in 1-11-Representations of Graphs
by: Das, Biswajit, et al.
Published: (2026)
by: Das, Biswajit, et al.
Published: (2026)
Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
by: Kurapov, Sergey, et al.
Published: (2024)
by: Kurapov, Sergey, et al.
Published: (2024)
Algorithmic methods of finite discrete structures. Isomorphism of Nonseparable Graphs
by: Kurapov, Sergey, et al.
Published: (2024)
by: Kurapov, Sergey, et al.
Published: (2024)
Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
by: Kurapov, Sergey, et al.
Published: (2024)
by: Kurapov, Sergey, et al.
Published: (2024)
Emerging consecutive pattern avoidance
by: Hassler, Nathanaël, et al.
Published: (2025)
by: Hassler, Nathanaël, et al.
Published: (2025)
Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
by: Kurapov, Sergey, et al.
Published: (2025)
by: Kurapov, Sergey, et al.
Published: (2025)
Bounds on Linear Turán Number for Trees
by: Adak, Rajat, et al.
Published: (2026)
by: Adak, Rajat, et al.
Published: (2026)
Linear versus centred chromatic numbers
by: Bose, Prosenjit, et al.
Published: (2022)
by: Bose, Prosenjit, et al.
Published: (2022)
Optimal Mixed Integer Linear Optimization Trained Multivariate Classification Trees
by: Alston, Brandon, et al.
Published: (2024)
by: Alston, Brandon, et al.
Published: (2024)
An Upper Bound on the Linear Turán Number of $k$-Crowns
by: Adak, Rajat
Published: (2026)
by: Adak, Rajat
Published: (2026)
Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
by: Bok, Jan, et al.
Published: (2025)
by: Bok, Jan, et al.
Published: (2025)
Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
by: Kurapov, Sergey, et al.
Published: (2024)
by: Kurapov, Sergey, et al.
Published: (2024)
Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems
by: Auger, David, et al.
Published: (2024)
by: Auger, David, et al.
Published: (2024)
A Necessary Condition for Connectedness of Solutions to Integer Linear Systems
by: Shigenobu, Takasugu, et al.
Published: (2025)
by: Shigenobu, Takasugu, et al.
Published: (2025)
A lattice on Dyck paths close to the Tamari lattice
by: Baril, Jean-Luc, et al.
Published: (2023)
by: Baril, Jean-Luc, et al.
Published: (2023)
Enumeration in the lattice of $q$-decreasing words
by: Baril, Jean-Luc, et al.
Published: (2025)
by: Baril, Jean-Luc, et al.
Published: (2025)
Product Structure and Tree-Decompositions
by: Liu, Chun-Hung, et al.
Published: (2024)
by: Liu, Chun-Hung, et al.
Published: (2024)
Twin-width of sparse random graphs
by: Hendrey, Kevin, et al.
Published: (2023)
by: Hendrey, Kevin, et al.
Published: (2023)
A Proof of the 2004 Albert-Grossman-Nowakowski-Wolfe Conjecture on Alternating Linear Clobber
by: Chen, Xinyue, et al.
Published: (2025)
by: Chen, Xinyue, et al.
Published: (2025)
3-Colouring Planar Graphs
by: Dujmović, Vida, et al.
Published: (2025)
by: Dujmović, Vida, et al.
Published: (2025)
Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
by: Mählmann, Nikolas
Published: (2025)
by: Mählmann, Nikolas
Published: (2025)
Sparse String Graphs and Region Intersection Graphs over Minor-Closed Classes have Linear Expansion
by: Karol, Nikolai, et al.
Published: (2026)
by: Karol, Nikolai, et al.
Published: (2026)
The Combinatorics of Motzkin Polyominoes
by: Baril, Jean-Luc, et al.
Published: (2024)
by: Baril, Jean-Luc, et al.
Published: (2024)
Grand zigzag knight's paths
by: Baril, Jean-Luc, et al.
Published: (2024)
by: Baril, Jean-Luc, et al.
Published: (2024)
Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
by: Seppelt, Tim
Published: (2023)
by: Seppelt, Tim
Published: (2023)
Nowhere-zero flow reconfiguration
by: Esperet, Louis, et al.
Published: (2025)
by: Esperet, Louis, et al.
Published: (2025)
Reachability in temporal graphs under perturbation
by: Enright, Jessica, et al.
Published: (2024)
by: Enright, Jessica, et al.
Published: (2024)
The Dominating 4-Colour Theorem
by: Girão, António, et al.
Published: (2026)
by: Girão, António, et al.
Published: (2026)
Similar Items
-
Product Structure and Treewidth of Hyperbolic Uniform Disk Graphs
by: Bläsius, Thomas, et al.
Published: (2026) -
Directed Acyclic Outerplanar Graphs Have Constant Stack Number
by: Jungeblut, Paul, et al.
Published: (2022) -
Three-dimensional graph products with unbounded stack-number
by: Eppstein, David, et al.
Published: (2022) -
Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
by: Spirkl, Sophie, et al.
Published: (2026) -
Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)