Edge-clique covers of the tensor product

DOI10.1016/J.TCS.2015.06.022zbMATH Open1332.05119OpenAlexW588093793MaRDI QIDQ897963FDOQ897963

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

Recommendations

• Edge-clique covers of the tensor product
• Clique covering of graphs
• Upper bounds on the edge clique cover number of a graph
• On the graph inequality \(\theta _{E}(G)\geqslant \theta _{E}(G^{m})\)
• scientific article; zbMATH DE number 3843787

zbMATH Keywords

tensor productprojective planeedge-clique cover

Mathematics Subject Classification ID

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

Cites Work

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

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

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