1 - 2 / 2 1 |
1. Computational complexity aspects of super domination Csilla Bujtás, Nima Ghanbari, Sandi Klavžar, 2023, izvirni znanstveni članek Ključne besede: super domination number, trees, bipartite graphs, k-subdivision of a graph, computational complexity, matching, II-matching number, II-matchings |
2. Maximum matchings in geometric intersection graphs Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer, 2023, izvirni znanstveni članek Ključne besede: computational geometry, geometric intersection graphs, disk graphs, unit-disk graphs, matchings |