( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Optimal L(3, 2, 1)-labeling of triangular lattice.

, , и . Discret. Appl. Math., (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Soumen De

Gerrit Peter Nandi

Miriam Nandi

Biswanath Nandi

Sukhendu Nandi

 

Другие публикации лиц с тем же именем

On Chromatic Number of Colored Mixed Graphs., , и . CALDAM, том 10156 из Lecture Notes in Computer Science, стр. 130-140. Springer, (2017)Enumeration of edge-critical underlying absolute planar cliques for signed graphs., , , и . Australas. J Comb., (2020)Efficient channel assignment for cellular networks modeled as honeycomb grid., , , , и . ICTCS, том 1231 из CEUR Workshop Proceedings, стр. 183-295. CEUR-WS.org, (2014)On (n,m)-chromatic numbers of graphs with bounded sparsity parameters., , , , и . Discret. Appl. Math., (2024)On the pushable chromatic number of various types of grids., , , , и . Discret. Appl. Math., (апреля 2023)Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon., , , , и . ICCSA (2), том 10405 из Lecture Notes in Computer Science, стр. 509-524. Springer, (2017)Erratum for Ön oriented cliques with respect to push operation"., , и . CoRR, (2018)New Bounds and Constructions for Neighbor-Locating Colorings of Graphs., , , , и . CALDAM, том 13947 из Lecture Notes in Computer Science, стр. 121-133. Springer, (2023)The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10., , и . CALDAM, том 12016 из Lecture Notes in Computer Science, стр. 260-266. Springer, (2020)A linear algorithm for radio k-coloring of powers of paths having small diameters., , , и . J. Comput. Syst. Sci., (2025)