Edge-clique covers of the tensor product

DOI10.1016/J.TCS.2015.06.022MaRDI QIDQ897963zbMATH OpenOpenAlexFDO

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

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

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)

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

Cites work

• scientific article; zbMATH DE number 4134090 (Why is no real title available?)
• scientific article; zbMATH DE number 434915 (Why is no real title available?)
• scientific article; zbMATH DE number 89406 (Why is no real title available?)
• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• scientific article; zbMATH DE number 3606214 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 3049937 (Why is no real title available?)
• A note on tensor product of graphs
• A simple lower bound on edge coverings by cliques
• Applications of edge coverings by cliques
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• Data reduction and exact algorithms for clique cover
• On economical set representations of graphs
• On the Computation of the Competition Number of a Graph
• On the order of magnitude of the difference between consecutive prime numbers
• The Representation of a Graph by Set Intersections

Cited in

(2)

• On the graph inequality \(\theta _{E}(G)\geqslant \theta _{E}(G^{m})\)
• Edge-clique covers of the tensor product

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)