( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
All graphs with at most seven vertices are Pairwise Compatibility Graphs

, , и . CoRR, (2012)

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.

Tiziana Margaria

Tiziana Roncoroni

Tiziana Ugoletti

Tiziana Chiusi

Tiziana Corda

 

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

An optimal layout of multigrid networks., и . Inf. Process. Lett., 72 (3-4): 137-141 (1999)The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography.. Comput. J., 49 (5): 585-608 (2006)L(2, 1)-labeling of planar graphs., и . DIAL-M, стр. 28-33. ACM, (2001)Labeling of Oriented Planar Graphs., и . CTW, стр. 93-96. (2011)On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs., , и . Discret. Math. Algorithms Appl., (2013)Pairwise Compatibility Graphs: A Survey., и . SIAM Rev., 58 (3): 445-460 (2016)A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs., , и . Theor. Comput. Sci., (2019)Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)., , и . WALCOM, том 5431 из Lecture Notes in Computer Science, стр. 165-176. Springer, (2009)Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers., , , и . SIROCCO, том 4474 из Lecture Notes in Computer Science, стр. 208-221. Springer, (2007)Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks., , , и . OPODIS, том 4878 из Lecture Notes in Computer Science, стр. 247-259. Springer, (2007)