On graphs with equal total domination and Grundy total domination numbers

A sequence (v1,…,vk)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(v_1,\ldots ,v_k)$$\end{document} of vertices in a graph G without isolated vertices is called a total dominating sequence if every vertex vi\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v_i$$\end{document} in the sequence totally dominates at least one vertex that was not totally dominated by {v1,…,vi-1}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{v_1,\ldots , v_{i-1}\}$$\end{document} and {v1,…,vk}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{v_1,\ldots ,v_k\}$$\end{document} is a total dominating set of G. The length of a shortest such sequence is the total domination number of G (γt(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _{t}(G)$$\end{document}), while the length of a longest such sequence is the Grundy total domination number of G (γgrt(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _{gr}^t(G)$$\end{document}). In this paper we study graphs with equal total and Grundy total domination numbers. We characterize bipartite graphs with both total and Grundy total dominations number equal to 4, and show that there is no connected chordal graph G with γt(G)=γgrt(G)=4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _{t}(G)=\gamma _{gr}^t(G)=4$$\end{document}. The main result of the paper is a characterization of bipartite graphs with γt(G)=γgrt(G)=6\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _{t}(G)=\gamma _{gr}^t(G)=6$$\end{document} proved by establishing a surprising correspondence between the existence of such graphs and a classical but still open problem of the existence of certain finite projective planes.