Map graphs

From MaRDI portal
Revision as of 22:01, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3196637

DOI10.1145/506147.506148zbMath1323.05039OpenAlexW2294414813MaRDI QIDQ3196637

Zhi-Zhong Chen, Christos H. Papadimitriou, Michelangelo Grigni

Publication date: 30 October 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/506147.506148




Related Items (36)

Graph separators: A parameterized viewClustered 3-colouring graphs of bounded degreeRainbow independent sets on dense graph classesTree densities in sparse graph classesMap graphs having witnesses of large girthRecognizing IC-Planar and NIC-Planar GraphsLinear-time recognition of map graphs with outerplanar witnessAn annotated bibliography on 1-planarity\(\mathsf{NIC}\)-planar graphsProper 1-immersions of graphs triangulating the planeStructure of Graphs with Locally Restricted CrossingsBook embeddings of \(k\)-framed graphs and \(k\)-map graphsAll 2-planar graphs having the same spanning subgraphClique-based separators for geometric intersection graphsStack and Queue Layouts via Layered SeparatorsGraph product structure for non-minor-closed classesOptimal 1-planar multigraphsRecognizing map graphs of bounded treewidthRecognizing optimal 1-planar graphs in linear timeOrthogonal Tree Decompositions of GraphsCharacterizing and recognizing 4-map graphsOn partitioning the edges of 1-plane graphsAnt colony optimization for finding medians of weighted graphsCharacterizing 5-map graphs by 2-fan-crossing graphsUnnamed ItemOn low rank-width coloringsMinimal Obstructions for 1-Immersions and Hardness of 1-Planarity TestingOn Aligned Bar 1-Visibility GraphsPlanar graphs having no proper 2-immersions in the plane. ICovering and packing of rectilinear subdivisionBetter bounds for poset dimension and boxicityHardness and structural results for half-squares of restricted tree convex bipartite graphsNotes on graph product structure theoryAlgorithmic graph minor theory: Improved grid minor bounds and Wagner's contractionDecomposition of Map Graphs with Applications.Unnamed Item







This page was built for publication: Map graphs