Infinite order domination in graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, vol.50, pp.179-194, 2004. ,

On the representation of directed graphs as unions of orderings, Math. Inst. Hung. Acad. Sci, vol.9, pp.125-132, 1964. ,

Eternal security in graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, vol.52, pp.169-180, 2005. ,

On representatives of subsets, Journal of the London Mathematical Society, vol.1, issue.1, pp.26-30, 1935. ,

Dividing a graph into triconnected components, SIAM Journal on Computing, p.135, 1973. ,

Eternal security in graphs of fixed independence number, Journal of Combinatorial Mathematics and Combinatorial Computing, vol.63, 2007. ,

Eternal dominating sets in graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, vol.68, pp.97-111, 2009. ,

Complexity of eternal security, Journal of Combinatorial Mathematics and Combinatorial Computing, vol.61, p.135, 2007. ,

Eternally secure sets, independence sets and cliques, AKCE Int. J. Graphs Comb, vol.2, pp.119-122, 2005. ,

Protecting a graph with mobile guards, Applicable Analysis and Discrete Mathematics, vol.10, issue.1, pp.1-29, 2016. ,

A theorem on graphs, with an application to a problem of traffic control, The American Mathematical Monthly, vol.46, issue.5, pp.281-283, 1939. ,

The comparability graph of a tree, Proceedings of the American Mathematical Society, vol.13, issue.5, pp.789-795, 1962. ,

Linear degree extractors and the inapproximability of max clique and chromatic number, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp.681-690, 2006. ,