Constrained representations of map graphs and half-squares
From MaRDI portal
Publication:5092371
DOI10.4230/LIPICS.MFCS.2019.13MaRDI QIDQ5092371FDOQ5092371
Authors: Hoàng-Oanh Le, Bang le van 
Publication date: 21 July 2022
Recommendations
Cites Work
- Topics in Intersection Graph Theory
- Title not available (Why is that?)
- Efficient graph representations
- Dually Chordal Graphs
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- Restricted Bipartite Graphs: Comparison and Hardness Results
- Approximation algorithms for independent sets in map graphs
- Map graphs
- The NP-Completeness of Some Edge-Partition Problems
- Title not available (Why is that?)
- Linearity of grid minors in treewidth with applications through bidimensionality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- Title not available (Why is that?)
- Characterizing and recognizing 4-map graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edge clique partition of \(K _{4}\)-free and planar graphs
- FO model checking on map graphs
- Linear-time recognition of map graphs with outerplanar witness
- Recognizing hole-free 4-map graphs in cubic time
- Title not available (Why is that?)
- Map graphs having witnesses of large girth
Cited In (1)
This page was built for publication: Constrained representations of map graphs and half-squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092371)
