1997•Discrete MathematicsOpen access
Covering a graph by complete bipartite graphs
Paul L. Erdos, L. Pyber
Open full text 46 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Open-access reader
Paul L. Erdos, L. Pyber
Abstract
Open-access reader
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 46 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Combinatorics, Mathematics, Bipartite graph, Complete bipartite graph, Cograph, Edge-transitive graph, Discrete mathematics, Robertson–Seymour theorem