On matching and total domination in graphs
暂无分享,去创建一个
[1] Stephen T. Hedetniemi,et al. Total domination in graphs , 1980, Networks.
[2] Raphael Yuster,et al. Some remarks on domination , 2004, J. Graph Theory.
[3] Michael A. Henning. A linear Vizing-like relation relating the size and total domination number of a graph , 2005, J. Graph Theory.
[4] Michael A. Henning,et al. Graphs with large total domination number , 2000, J. Graph Theory.
[5] Michael A. Henning,et al. Total domination in claw-free graphs with minimum degree 2 , 2008, Discret. Math..
[6] David P. Sumner. On Tutte's factorization theorem , 1974 .
[7] Béla Bollobás,et al. Graph-theoretic parameters concerning domination, independence, and irredundance , 1979, J. Graph Theory.
[8] Colin McDiarmid,et al. Small transversals in hypergraphs , 1992, Comb..
[9] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.
[10] G. Winskel. What Is Discrete Mathematics , 2007 .
[11] Anders Yeo,et al. Total domination of graphs and small transversals of hypergraphs , 2007, Comb..
[12] Michael A. Henning,et al. Paired-Domination in Claw-Free Cubic Graphs , 2004, Graphs Comb..
[13] S. Hedetniemi,et al. Domination in graphs : advanced topics , 1998 .
[14] Raphael Yuster,et al. Some remarks on domination , 2004 .
[15] D. Sumner. 1‐Factors and Antifactor Sets , 1976 .