Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference29 articles.
1. Proofs from THE BOOK;Aigner,2010
2. Perfect codes in graphs;Biggs;J. Combin. Theory Ser. (B),1973
3. Kernel bounds for disjoint cycles and disjoint paths;Bodlaender;Theoret. Comput. Sci.,2011
4. A. Brandstädt, C. Hundt, R. Nevries, Efficient edge domination on hole-free graphs in polynomial time, in: Proceedings of the 9th Latin American Symposium on Theoretical Informatics, LATIN, 2010, pp. 650–661.
5. A. Brandstädt, A. Leitert, D. Rautenbach, Efficient dominating and edge dominating sets for graphs and hypergraphs, in: Proceedings of the 23rd International Symposium on Algorithms and Computation, ISAAC, 2012, pp. 267–277.