Map graphs
From MaRDI portal
Recommendations
Cited in
(45)- Proper 1-immersions of graphs triangulating the plane
- A completely PPT map
- Rainbow independent sets on dense graph classes
- On low rank-width colorings
- Graph separators: A parameterized view
- Orthogonal tree decompositions of graphs
- Clustered 3-colouring graphs of bounded degree
- Recognizing IC-planar and NIC-planar graphs
- Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- New bounds on the edge number of ak-map graph
- Graph product structure for non-minor-closed classes
- Recognizing optimal 1-planar graphs in linear time
- Map graphs having witnesses of large girth
- Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
- Tree densities in sparse graph classes
- Characterizing Sparse Graphs by Map Decompositions
- Clustered coloring of graphs with bounded layered treewidth and bounded degree
- Planar graphs having no proper 2-immersions in the plane. I
- Recognizing map graphs of bounded treewidth
- Constrained representations of map graphs and half-squares
- Linear-time recognition of map graphs with outerplanar witness
- Characterizing 5-map graphs by 2-fan-crossing graphs
- scientific article; zbMATH DE number 1001517 (Why is no real title available?)
- scientific article; zbMATH DE number 1511678 (Why is no real title available?)
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
- A parameterized algorithm for vertex and edge connectivity of embedded graphs
- Covering and packing of rectilinear subdivision
- Ant colony optimization for finding medians of weighted graphs
- Kick the cliques
- All 2-planar graphs having the same spanning subgraph
- Structure of graphs with locally restricted crossings
- \(\mathsf{NIC}\)-planar graphs
- An annotated bibliography on 1-planarity
- Optimal 1-planar multigraphs
- Notes on graph product structure theory
- On partitioning the edges of 1-plane graphs
- Clique-based separators for geometric intersection graphs
- Twin-width of planar graphs is at most 8, and some related bounds
- Better bounds for poset dimension and boxicity
- Characterizing and recognizing 4-map graphs
- Decomposition of Map Graphs with Applications.
- On Aligned Bar 1-Visibility Graphs
- scientific article; zbMATH DE number 7053376 (Why is no real title available?)
- scientific article; zbMATH DE number 1775439 (Why is no real title available?)
This page was built for publication: Map graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196637)
