Biclique cover and local clique cover of graphs

DOI10.1007/s41980-018-0016-yzbMath1409.05050OpenAlexW2783924065WikidataQ130195055 ScholiaQ130195055MaRDI QIDQ1734028

Farokhlagha Moazami

Publication date: 22 March 2019

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41980-018-0016-y

zbMATH Keywords

clique coverintersection representationbiclique coverlocal biclique coverlocal clique cover

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

The biclique covering number of grids

Cites Work

• Unnamed Item
• Unnamed Item
• Biclique covers and partitions
• On the biclique cover of the complete graph
• On covering graphs by complete bipartite subgraphs
• Clique partitions of the cocktail party graph
• Covering graphs by the minimum number of equivalence relations
• On a clique covering problem of Orlin
• Covering a graph by complete bipartite graphs
• Generalized cover-free families.
• Some new bounds for cover-free families through biclique covers
• Chromatic number via Turán number
• On biclique coverings
• A Note on d-Biclique Covers
• Local Clique Covering of Claw-Free Graphs
• Kneser Representations of Graphs
• On set intersection representations of graphs
• Topics in Intersection Graph Theory
• A Generalization of Cover Free Families
• Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
• Secure Frameproof Code Through Biclique Cover

This page was built for publication: Biclique cover and local clique cover of graphs