scientific article; zbMATH DE number 7561657

DOI10.4230/LIPIcs.MFCS.2019.13MaRDI QIDQ5092371

Bang le van, Hoàng-Oanh Le

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph classesedge clique coveredge clique partitionhalf-squaremap graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Recognizing map graphs of bounded treewidth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complete width and edge clique cover problems
• Linearity of grid minors in treewidth with applications through bidimensionality
• Efficient graph representations
• Linear-time recognition of map graphs with outerplanar witness
• FO model checking on map graphs
• Characterizing and recognizing 4-map graphs
• Recognizing hole-free 4-map graphs in cubic time
• Map graphs having witnesses of large girth
• Approximation Algorithms for Independent Sets in Map Graphs
• Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
• Edge Clique Partition of K 4-Free and Planar Graphs
• Map graphs
• The NP-Completeness of Some Edge-Partition Problems
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• Dually Chordal Graphs
• Topics in Intersection Graph Theory
• Restricted Bipartite Graphs: Comparison and Hardness Results
• Hardness and structural results for half-squares of restricted tree convex bipartite graphs

This page was built for publication: