On a Generalization of Bi-Complement Reducible Graphs
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Counting spanning trees in graphs using modular decomposition
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Structural results on circular-arc graphs and circle graphs: A survey and the main open problems
Discrete Applied Mathematics
Hi-index | 0.04 |