5
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Choosability and edge choosability of planar graphs without five cycles

      ,
      Applied Mathematics Letters
      Elsevier BV

      Read this article at

      ScienceOpenPublisher
      Bookmark
          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 references2

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

          List edge chromatic number of graphs with large girth

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

            Graphs of degree 4 are 5-edge-choosable

              Bookmark

              Author and article information

              Journal
              Applied Mathematics Letters
              Applied Mathematics Letters
              Elsevier BV
              08939659
              July 2002
              July 2002
              : 15
              : 5
              : 561-565
              Article
              10.1016/S0893-9659(02)80007-6
              b0aed5d6-6ef6-4366-b522-c4fccd721043
              © 2002

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

              History

              Comments

              Comment on this article