Intersection graphs with and without product structure

DOI10.4230/LIPICS.GD.2024.23MaRDI QIDQ6920458zbMATH OpenFDO

Authors Laura Merker, Lena Scherzer, Samuel Schneider, Torsten Ueckerdt

Publication date 7 October 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.GD.2024.23

zbMATH Keywords

intersection graphsproduct structurelinear local treewidth

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• Adjacency Labelling for Planar Graphs (and Beyond)
• An improved planar graph product structure theorem
• Clustered 3-colouring graphs of bounded degree
• Graph minors. II. Algorithmic aspects of tree-width
• Graph product structure for h-framed graphs
• Graph product structure for non-minor-closed classes
• Improved bounds for centered colorings
• Layered separators in minor-closed graph classes with applications
• Notes on graph product structure theory
• On Comparable Box Dimension
• On fan-crossing graphs
• Planar graphs have bounded nonrepetitive chromatic number
• Planar graphs have bounded queue-number
• Powers of planar graphs, product structure, and blocking partitions (extended abstract)
• Proof of the clustered Hadwiger conjecture
• Separating layered treewidth and row treewidth
• Shallow Minors, Graph Products, and Beyond-Planar Graphs
• Shorter Labeling Schemes for Planar Graphs
• Sparse universal graphs for planarity

This page was built for publication: Intersection graphs with and without product structure

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