On the coverings of graphs
From MaRDI portal
Publication:1147719
DOI10.1016/0012-365X(80)90109-0zbMath0451.05037MaRDI QIDQ1147719
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Coverings of r—graphs by complete r—partite subgraphs, Graph theory (algorithmic, algebraic, and metric problems), Consensus algorithms for the generation of all maximal bicliques, Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices, The conjunctive complexity of quadratic Boolean functions, On covering graphs by complete bipartite subgraphs, Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices. I, Bandwidth of theta graphs with short paths, Covers of Eulerian graphs, Subgraph coverings and edge switchings, Chromatic characterization of biclique covers, On biclique coverings, On the Decomposition of Graphs
Cites Work