Publications

  1. M. Yatauro. Parameterized binding numbers and degree sequence theorems, Discrete Math. Lett. 12 (2023), 225–232.
  2. M. Yatauro. Wiener index and vulnerability parameters of graphs, Discrete Appl. Math. 338 (2023), 56–68.
  3. M. Yatauro. Stability theorems for graph vulnerability parameters, Graphs and Combin. 37 (2021), 221–239.
  4. M. Yatauro. The edge cover probability polynomial of a graph and optimal network construction, IEEE Trans. Network Sci. Eng. 6(3) (2019), 538–547.
  5. M. Yatauro. Binary strings and reliability of path networks, Congr. Numer. 229 (2017), 285 – 293.
  6. D. Gross, M. Heinig, J. Saccoman, C. Su ffel, and M. Yatauro. On reliability models associated with the edge domination number for trees, Congr. Numer. 227 (2016), 65 – 83.
  7. M. Yatauro. Vertex degrees, binding number, and 2-factors, Congr. Numer. 225 (2015), 107 – 118.
  8. D. Bauer, A. Nevo, E. Schmeichel, D. R. Woodall, and M. Yatauro. Best monotone degree conditions for binding number and cycle structure, Discrete Appl. Math. 195 (2015), 8 – 17.
  9. D. Bauer, H. J. Broersma, J. van den Heuvel, N. Kahl, A. Nevo, E. Schmeichel, D. R. Woodall, and M. Yatauro. Best monotone degree conditions for graph properties: A survey, Graphs Combin. 31 (2015), no. 1, 1 – 22.
  10. M. Yatauro. Component order connectivity and vertex degrees, Congr. Numer. 220 (2014), 195 – 205.
  11. M. Yatauro. Binding number and tenacity, J. Combin. Math. Combin. Comput. 91 (2014), 185 – 196.
  12. D. Bauer, N. Kahl, E. Schmeichel, D. R. Woodall, and M. Yatauro . Toughness and binding number, Discrete Appl. Math. 165 (2014), 60 – 68.
  13. D. Bauer, N. Kahl, E. Schmeichel, D. R. Woodall, and M. Yatauro. Improving theorems in a best monotone sense, Congr. Numer. 216 (2013), 87 – 95.
  14. D. Bauer, N. Kahl, E. Schmeichel, and M. Yatauro. Best monotone degree conditions for binding number, Discrete Math. 311 (2011), no. 18 – 19, 2037 – 2043.