For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
5
views
9
references
 Top references
cited by
13
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      2,018
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Article: not found

      Coloring nearly-disjoint hypergraphs with n + o(n) colors

      Author(s):
      Publication date Created:
      Publication date (Print):
      Journal: Journal of Combinatorial Theory, Series A
      Publisher: Elsevier BV

      Read this article at

      ScienceOpenPublisher
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references9

          • Record: found
          • Abstract: not found
          • Article: not found

          On the combinatorial problems which I would most like to see solved

          P Erdös (1981)
          Article 0 comments Cited 57 times – based on 0 reviews     Review now
            • Record: found
            • Abstract: not found
            • Article: not found

            On a Packing and Covering Problem

            Vojtech Rödl (1985)
            Article 0 comments Cited 50 times – based on 0 reviews     Review now
              • Record: found
              • Abstract: not found
              • Article: not found

              Asymptotic behavior of the chromatic index for hypergraphs

              Joel Spencer, Nicholas Pippenger (1989)
              Article 0 comments Cited 37 times – based on 0 reviews     Review now
                All references

                Author and article information

                Journal
                Title: Journal of Combinatorial Theory, Series A
                Abbreviated Title: Journal of Combinatorial Theory, Series A
                Publisher: Elsevier BV
                ISSN (Print): 00973165
                Publication date Created: January 1992
                Publication date (Print): January 1992
                Volume: 59
                Issue: 1
                Pages: 31-39
                Article
                DOI: 10.1016/0097-3165(92)90096-D
                SO-VID: c32b89de-2b5b-4a88-8652-673e39b9ecb6
                Copyright © © 1992
                License:

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Data availability:

                Comments

                Comment on this article

                Related Documents Log
                scite_

                Similar content2,018

                See all similar

                Cited by13

                See all cited by

                Most referenced authors28

                See all reference authors