Bichromatic P4-composition schemes for perfect orderability
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
An O(nm)-time certifying algorithm for recognizing HHD-free graphs
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Recognizing HHD-free and welsh-powell opposition graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
An O(nm)-time certifying algorithm for recognizing HHD-free graphs
Theoretical Computer Science
On opposition graphs, coalition graphs, and bipartite permutation graphs
Discrete Applied Mathematics
Hi-index | 0.05 |