Author of the publication

Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints.

, , , and . Random Struct. Algorithms, 23 (4): 409-433 (2003)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The biparticity of a graph., , and . J. Graph Theory, 1 (2): 131-133 (1977)On randomized greedy matchings., and . Random Struct. Algorithms, 10 (3): 353-383 (1997)The steiner problem in the hypercube., and . Networks, 22 (1): 1-19 (1992)A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs., and . Aegean Workshop on Computing, volume 227 of Lecture Notes in Computer Science, page 252-260. Springer, (1986)Embedding Grids into Hypercubes., , and . AWOC, volume 319 of Lecture Notes in Computer Science, page 201-211. Springer, (1988)Optimum Simulation of Meshes by Small Hypercubes., , and . IMYCS, volume 464 of Lecture Notes in Computer Science, page 30-46. Springer, (1990)Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints., , , and . Random Struct. Algorithms, 23 (4): 409-433 (2003)On Mapping Complete Binary Trees into Grids and Extended Grids., , , , and . ISPAN, page 242-247. IEEE Computer Society, (1999)Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract)., , , and . Canada-France Conference on Parallel and Distributed Computing, volume 805 of Lecture Notes in Computer Science, page 73-80. Springer, (1994)On the bandwidth of the Kneser graph., , and . Discret. Appl. Math., (2017)