Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
From MaRDI portal
Publication:6064836
DOI10.1016/j.dam.2023.06.013zbMath1528.05015arXiv2104.03937OpenAlexW3142555249MaRDI QIDQ6064836
Flavia Bonomo-Braberman, Gastón Abel Brito
Publication date: 11 December 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.03937
forbidden patternsbipartite permutation graphsthinnessinterval bigraphsVPG graphsintersection graphs of rectangles
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Max point-tolerance graphs
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- A linear-time algorithm for proper interval graph recognition
- Graph minors. III. Planar tree-width
- Thinness of product graphs
- Solving problems on generalized convex graphs via mim-width
- An optimal greedy heuristic to color interval graphs
- Edge intersection graphs of systems of paths on a grid with a bounded number of bends
- Graph minors. I. Excluding a forest
- Bipartite permutation graphs
- A new property of critical imperfect graphs and some consequences
- Optimal packing and covering in the plane are NP-complete
- Optimal labelling of a product of two paths
- Comparability graphs and a new matroid
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Recognizing interval digraphs and interval bigraphs in polynomial time
- On grounded \(\llcorner\)-graphs and their relatives
- On the thinness and proper thinness of a graph
- The stable set problem and the thinness of a graph
- Ordering without Forbidden Patterns
- Edge intersection graphs of single bend paths on a grid
- Vertex Intersection Graphs of Paths on a Grid
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- The bandwidth problem for graphs and matrices—a survey
- Algorithms on circular-arc graphs
- Interval bigraphs and circular arc graphs
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
- Twin-width I: Tractable FO Model Checking
- (c-)AND: A new graph model
- Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
- Topology of Thin Film RC Circuits
- Graph Classes and Forbidden Patterns on Three Vertices
- Twin-width and transductions of proper \(k\)-mixed-thin graphs
- Recognizing interval bigraphs by forbidden patterns
This page was built for publication: Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
