On covering graphs by complete bipartite subgraphs
Authors:
- S. JuknaSJS. Jukna
- A.S. KulikovAKA.S. Kulikov
- 1 May 2009
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 309 (10) , 3399-3403
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On Graph ComplexityCombinatorics, Probability and Computing, 2006
- Problems and results in extremal combinatorics—IDiscrete Mathematics, 2003
- Graph Complexity and Slice FunctionsTheory of Computing Systems, 2003
- The Shrinkage Exponent of de Morgan Formulas is 2SIAM Journal on Computing, 1998
- Fractional Covers and Communication ComplexitySIAM Journal on Discrete Mathematics, 1995
- Complexity classes in communication complexity theory1986
- Covering graphs by the minimum number of equivalence relationsCombinatorica, 1986
- On the coverings of graphsDiscrete Mathematics, 1980
- On the Addressing Problem for Loop SwitchingBell System Technical Journal, 1971
- Method of determining lower bounds for the complexity of P-schemesMathematical Notes, 1971