Author of the publication

Graphs with Dilworth Number Two are Pairwise Compatibility Graphs.

, and . Electron. Notes Discret. Math., (2013)

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

Parallel Algorithms for Dandelion-Like Codes., and . ICCS (1), volume 5544 of Lecture Notes in Computer Science, page 611-620. Springer, (2009)Tree partitioning via vertex deletion., and . Electron. Notes Discret. Math., (2001)A Simple Parallel Algorithm to Draw Cubic Graphs., , and . IEEE Trans. Parallel Distributed Syst., 11 (10): 1009-1018 (2000)Hierarchical Clustering of Trees: Algorithms and Experiments., and . ALENEX, volume 2153 of Lecture Notes in Computer Science, page 117-131. Springer, (2001)On the Radiocoloring Problem., and . IWDC, volume 2571 of Lecture Notes in Computer Science, page 118-127. Springer, (2002)Edge-clique graphs and the l-coloring problem., and . J. Braz. Comp. Soc., 7 (3): 38-47 (2001)Graph Coloring with Distance Constraints., , and . PDPTA, page 131-140. CSREA Press, (2005)Bijective Linear Time Coding and Decoding for k-Trees., , and . Theory Comput. Syst., 46 (2): 284-300 (2010)Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life., and . Bull. EATCS, (2016)Divider-based algorithms for hierarchical tree partitioning., and . Discret. Appl. Math., 136 (2-3): 227-247 (2004)