Cites work
Cited in
(26)- 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
- On the chromatic number of \(2 K_2\)-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Chromatic bounds for some classes of 2 K₂-free graphs
- Subgraph coverings and edge switchings
- An overview of graph covering and partitioning
- Chromatic characterization of biclique covers
- On biclique coverings
- On the Decomposition of Graphs
- Biclique covers and partitions
- Problems and invariants connected with bicliques and multicliques of graphs
- Coverings of r—graphs by complete r—partite subgraphs
- Cycle packing
- Graph theory (algorithmic, algebraic, and metric problems)
- 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
- Towards the Erdős-Gallai cycle decomposition conjecture
- -boundedness and related problems on graphs without long induced paths: a survey
- Consensus algorithms for the generation of all maximal bicliques
- Path odd-covers of graphs
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- The conjunctive complexity of quadratic Boolean functions
This page was built for publication: On the coverings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1147719)
