Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference39 articles.
1. Amjadi, J.: An upper bound on the double domination number of trees. Kragujevac J. Math. 39, 133–139 (2015)
2. Aram, H., Khoeilar, R., Sheikholeslami, S.M., Volkmann, L.: Relating the annihilation number and the Roman domination number. Acta Math. Univ. Comenianae 87, 1–13 (2018)
3. Beckenbach, I., Borndörfer, R.: Hall’s and König’s theorem in graphs and hypergraphs. Discrete Math. 341, 2753–2761 (2018)
4. Bourjolly, J.M., Pulleyblank, W.R.: König–Egerváry graphs, 2-bicritical graphs and fractional matchings. Discrete Appl. Math. 24, 63–82 (1989)
5. Bujtás, C.S., Jakovac, M.: Relating the total domination number and the annihilation number of cactus graphs and block graphs. Ars Math. Contemp. 16, 183–202 (2019)