( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Splitting Number of the 4-Cube.

, , и . LATIN, том 1380 из Lecture Notes in Computer Science, стр. 141-150. Springer, (1998)

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.

Giovanna Negrão de Figueiredo

Flávia Figueiredo de Rezende Felipe

Celina Schätze

Celina Cziepluch

Celina Kress

 

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

Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3., , и . LATIN, том 8392 из Lecture Notes in Computer Science, стр. 13-23. Springer, (2014)An Improved Upper Bound on the Crossing Number of the Hypercube., , , и . WG, том 2880 из Lecture Notes in Computer Science, стр. 230-236. Springer, (2003)A Linear-Time Algorithm for Proper Interval Graph Recognition., , и . Inf. Process. Lett., 56 (3): 179-184 (1995)The Cost of Perfection for Matchings in Graphs, , и . CoRR, (2012)The non planar vertex deletion of Cn x Cm., , , , и . Ars Comb., (2005)The tessellation problem of quantum walks., , , , , , , и . CoRR, (2017)A computational complexity comparative study of graph tessellation problems., , , , , , и . Theor. Comput. Sci., (2021)On Edge-Colouring Indifference Graphs., , и . Theor. Comput. Sci., 181 (1): 91-106 (1997)Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3., , и . Theor. Comput. Sci., (2016)Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs., , , и . WAOA, том 7846 из Lecture Notes in Computer Science, стр. 82-92. Springer, (2012)