Edge-clique covers of the tensor product

DOI10.1016/j.tcs.2015.06.022zbMath1332.05119OpenAlexW588093793MaRDI QIDQ897963

Yue-Li Wang, Wing-Kai Hon, Hsiang-Hsuan Liu, Ton Kloks

Publication date: 8 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.022

zbMATH Keywords

projective planetensor productedge-clique cover

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Applications of edge coverings by cliques
• A simple lower bound on edge coverings by cliques
• Known Algorithms for Edge Clique Cover are Probably Optimal
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• On the Computation of the Competition Number of a Graph
• Data reduction and exact algorithms for clique cover
• The Representation of a Graph by Set Intersections
• On the order of magnitude of the difference between consecutive prime numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge-clique covers of the tensor product