Numbers

Bibliography of the person, including all types of documents, not only theses.

PhD theses (1)

1. Vesna Iršič Chenoweth: Domination games

Other documents (17)

1. Csilla Bujtás, Akbar Davoodi, Laihao Ding, Ervin Győri, Zsolt Tuza, Donglei Yang: Covering the edges of a graph with triangles
2. Gülnaz Boruzanli Ekinci, Csilla Bujtás: On the equality of domination number and 2-domination number
3. Csilla Bujtás, Michael A. Henning, Sandi Klavžar: Partial domination in supercubic graphs
4. Csilla Bujtás, Nima Ghanbari, Sandi Klavžar: Computational complexity aspects of super domination
5. Csilla Bujtás, Pakanun Dokyeesun, Sandi Klavžar: Maker-Breaker domination game on trees when Staller wins
6. Boštjan Brešar, Csilla Bujtás, Vesna Iršič Chenoweth, Douglas F. Rall, Zsolt Tuza: Indicated domination game
7. Csilla Bujtás, Pakanun Dokyeesun: Fast winning strategies for Staller in the Maker-Breaker domination game
8. Csilla Bujtás, Sandi Klavžar, Jing Tian: Total mutual-visibility in Hamming graphs
9. Csilla Bujtás, Günter Rote, Zsolt Tuza: Optimal strategies in fractional games: vertex cover and domination
10. Csilla Bujtás, Sandi Klavžar, Jing Tian: Visibility polynomials, dual visibility spectrum, and characterization of total mutual-visibility sets
11. Boštjan Brešar, Csilla Bujtás, Pakanun Dokyeesun, Tanja Dravec: Thresholds for the biased Maker-Breaker domination games
12. Csilla Bujtás, Vesna Iršič Chenoweth, Sandi Klavžar, Gang Zhang: Revisiting $d$-distance (independent) domination in trees and in bipartite graphs
13. Gülnaz Boruzanli Ekinci, Csilla Bujtás, Didem Gozüpek, Sandi Klavžar: S-packing chromatic critical graphs
14. Csilla Bujtás, Vesna Iršič Chenoweth, Sandi Klavžar, Gang Zhang: The $d$-distance $p$-packing domination number: complexity, cycles, and trees
15. Csilla Bujtás, Michael A. Henning: Paired domination in graphs with minimum degree four
16. Gábor Bacsó, Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer: The robust chromatic number of certain graph classes
17. Gülnaz Boruzanli Ekinci, Csilla Bujtás: Mutual-visibility problems in Kneser and Johnson graphs