Covering a graph by complete bipartite graphs

DOI10.1016/S0012-365X(96)00124-0zbMATH Open0876.05080OpenAlexW2049398763WikidataQ104010005 ScholiaQ104010005MaRDI QIDQ1363672FDOQ1363672

Authors: Laszló Pyber, P. Erdős 

Publication date: 10 August 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00124-0

Recommendations

• Bipartite Coverings of Graphs
• scientific article; zbMATH DE number 3841905
• Decomposition of random graphs into complete bipartite graphs
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• On covering graphs by complete bipartite subgraphs

zbMATH Keywords

partitioncoveringscomplete bipartite graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• On the Addressing Problem for Loop Switching
• On the information rate of secret sharing schemes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• Circuit coverings of graphs and a conjecture of Pyber

Cited In (35)

• On set intersection representations of graphs
• On difference graphs and the local dimension of posets
• An overview of graph covering and partitioning
• Counting vertices and cubes in median graphs of circular split systems
• Title not available (Why is that?)
• Biclique cover and local clique cover of graphs
• Title not available (Why is that?)
• Exact information ratios for secret sharing on small graphs with girth at least 5
• On covering numbers, Young diagrams, and the local dimension of posets
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• Title not available (Why is that?)
• On the decomposition of graphs into complete bipartite graphs
• On covering graphs by complete bipartite subgraphs
• On biclique coverings
• Secret-sharing schemes for very dense graphs
• Decomposition of random graphs into complete bipartite graphs
• Secret sharing on large girth graphs
• Secret sharing schemes for dense forbidden graphs
• Secret sharing schemes for ports of matroids of rank 3.
• Biclique covers and partitions
• Determination of the star valency of a graph
• Erdős-Pyber theorem for hypergraphs and secret sharing
• On the biclique cover of the complete graph
• Secret sharing on the \(d\)-dimensional cube
• Local boxicity and maximum degree
• Title not available (Why is that?)
• Edge clique covering sum of graphs
• Some new bounds for cover-free families through biclique covers
• Succinct computational secret sharing
• Local clique covering of claw-free graphs
• Title not available (Why is that?)
• Bipartite Coverings of Graphs
• On-line secret sharing
• Title not available (Why is that?)
• Growing balanced covering sets

This page was built for publication: Covering a graph by complete bipartite graphs

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