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

      On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ (G) = 3

      Journal of Combinatorial Optimization
      Springer Nature

      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 references4

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

          Adjacent strong edge coloring of graphs

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

            Vertex-distinguishing proper edge-colorings

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

              Vertex-distinguishing edge colorings of graphs

                Bookmark

                Author and article information

                Journal
                Journal of Combinatorial Optimization
                J Comb Optim
                Springer Nature
                1382-6905
                1573-2886
                May 16 2007
                January 4 2007
                : 14
                : 1
                : 87-109
                Article
                10.1007/s10878-006-9038-0
                e340cfde-dcc0-40fe-8d37-32a9e745ba53
                © 2007
                History

                Comments

                Comment on this article