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

      Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees

      Journal of Algorithms
      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 references9

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

          An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

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

            The monadic second-order logic of graphs. I. Recognizable sets of finite graphs

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

              Complexity of Finding Embeddings in a k-Tree

                Bookmark

                Author and article information

                Journal
                Journal of Algorithms
                Journal of Algorithms
                Elsevier BV
                01966774
                December 1990
                December 1990
                : 11
                : 4
                : 631-643
                Article
                10.1016/0196-6774(90)90013-5
                a28deed3-8880-4c7e-b744-1e4ecf6ca5ea
                © 1990

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

                History

                Comments

                Comment on this article