A remark on covering graphs
- 1 September 1985
- journal article
- research article
- Published by Springer Nature in Order
- Vol. 2 (3) , 321-322
- https://doi.org/10.1007/bf00333136
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability ProblemCanadian Journal of Mathematics, 1982