Constrained representations of map graphs and half-squares
From MaRDI portal
Recommendations
Cites work
- Approximation algorithms for independent sets in map graphs
- Characterizing and recognizing 4-map graphs
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- Dually Chordal Graphs
- Edge clique partition of \(K _{4}\)-free and planar graphs
- Efficient graph representations
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- FO model checking on map graphs
- scientific article; zbMATH DE number 4134090 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3582190 (Why is no real title available?)
- scientific article; zbMATH DE number 1305408 (Why is no real title available?)
- scientific article; zbMATH DE number 2044920 (Why is no real title available?)
- scientific article; zbMATH DE number 1775439 (Why is no real title available?)
- scientific article; zbMATH DE number 4121434 (Why is no real title available?)
- scientific article; zbMATH DE number 7053376 (Why is no real title available?)
- Linear-time recognition of map graphs with outerplanar witness
- Linearity of grid minors in treewidth with applications through bidimensionality
- Map graphs
- Map graphs having witnesses of large girth
- Recognizing hole-free 4-map graphs in cubic time
- Restricted Bipartite Graphs: Comparison and Hardness Results
- The NP-Completeness of Some Edge-Partition Problems
- Topics in Intersection Graph Theory
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)
