Skip to main content
SpringerLink
Log in

Independent transversals of hypergraph edges and bipartite bigraphs

  • Brief Communication
  • Published:
Cybernetics and Systems Analysis Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. L. Lovasz, “Coverings and colorings of hypergraphs,” in: Proc. 4th Southeastern Conf. on Combin., Graph Theory and Computing, Util. Math. Publ. (1973), pp. 3–12.

  2. V. Chvatal and P. L. Hammer, “Aggregation of inequalities in integer programming,” Ann. Discr. Math., No. 1, 145-162 (1977).

  3. M. D. Plummer, “Well-covered graphs: a survey,” Quest. Math., No. 16, 253-287 (1993).

  4. S. A. Cook, “The complexity of theorem-proving procedures,” in: Proc. 3rd Ann. ACM Symp. on Theory of Computing, New York (1971), pp. 151-158.

Download references

Authors
  1. I. E. Zverovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 167–170, March–April, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zverovich, I.E. Independent transversals of hypergraph edges and bipartite bigraphs. Cybern Syst Anal 35, 324–326 (1999). https://doi.org/10.1007/BF02733480

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02733480

Keywords

Search

Navigation