Author:
Brandt Stephan,Müttel Janina,Rautenbach Dieter
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. Induced S(K1,3) and Hamiltonian cycles in the square of a graph;Abderrezzak;Discrete Math.,1999
2. S. Brandt, J. Müttel, D. Rautenbach, The circumference of the square of a connected graph (submitted for publication).
3. The square of every two-connected graph is Hamiltonian;Fleischner;J. Combin. Theory Ser. B,1974
4. In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts;Fleischner;Monatsh. Math.,1976
5. Trees with Hamiltonian square;Harary;Mathematika,1971