The following pages link to On the coverings of graphs (Q1147719):
Displaying 22 items.
- Biclique covers and partitions (Q405095) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices (Q802577) (← links)
- The conjunctive complexity of quadratic Boolean functions (Q808253) (← links)
- On covering graphs by complete bipartite subgraphs (Q1025967) (← links)
- Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices. I (Q1153930) (← links)
- Bandwidth of theta graphs with short paths (Q1197053) (← links)
- Covers of Eulerian graphs (Q1417961) (← links)
- On the chromatic number of \(2 K_2\)-free graphs (Q1634757) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Chromatic bounds for some classes of \(2 K_2\)-free graphs (Q1783621) (← links)
- Subgraph coverings and edge switchings (Q1850576) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Chromatic characterization of biclique covers (Q2368922) (← links)
- On biclique coverings (Q2468013) (← links)
- On the Decomposition of Graphs (Q3964612) (← links)
- (Q4691855) (← links)
- Coverings of r—graphs by complete r—partite subgraphs (Q4697821) (← links)
- Cycle packing (Q5256386) (← links)
- Bounds for the chromatic number of some \(pK_2\)-free graphs (Q6103479) (← links)
- Towards the Erdős-Gallai cycle decomposition conjecture (Q6184561) (← links)
