12
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 Intersecting Triangles

      ,
      SIAM Journal on Discrete Mathematics
      Society for Industrial & Applied Mathematics (SIAM)

      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 references15

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

          Every Planar Graph Is 5-Choosable

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

            Colorings and orientations of graphs

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

              List colourings of planar graphs

                Author and article information

                Journal
                SIAM Journal on Discrete Mathematics
                SIAM J. Discrete Math.
                Society for Industrial & Applied Mathematics (SIAM)
                0895-4801
                1095-7146
                January 2002
                January 2002
                : 15
                : 4
                : 538-545
                Article
                10.1137/S0895480100376253
                f57c36b6-1c29-42a5-bb2c-783999c350d7
                © 2002
                History

                Comments

                Comment on this article

                Related Documents Log