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)
Related Items
On the Decomposition of Graphs, Chromatic characterization of biclique covers, On the chromatic number of \(2 K_2\)-free graphs, An overview of graph covering and partitioning, Unnamed Item, Biclique covers and partitions, Bounds for the chromatic number of some \(pK_2\)-free graphs, Distributing and parallelizing non-canonical loops, Towards the Erdős-Gallai cycle decomposition conjecture, Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices. I, Covers of Eulerian graphs, Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey, On biclique coverings, Bandwidth of theta graphs with short paths, Consensus algorithms for the generation of all maximal bicliques, Graph theory (algorithmic, algebraic, and metric problems), Chromatic bounds for some classes of \(2 K_2\)-free graphs, Coverings of r—graphs by complete r—partite subgraphs, On covering graphs by complete bipartite subgraphs, Subgraph coverings and edge switchings, Cycle packing, Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices, The conjunctive complexity of quadratic Boolean functions
Cites Work
