Lamač, Jan; Vlasák, Miloslav: Finding vertex-disjoint cycle cover of undirected graph using the least-squares method.
(English).
In:
Chleboun, J., Kůs, P., Papež, J., Rozložník, M., Segeth, K.
and Šístek, J. (eds.): Programs and Algorithms of Numerical Mathematics.
Proceedings of Seminar. Jablonec nad Nisou, June 19-24, 2022.
Institute of Mathematics CAS, Prague, 2023.
pp. 97-106
Ramezani, Farzaneh; Rowlinson, Peter; Stanić, Zoran:
Signed graphs with at most three eigenvalues.
(English).Czechoslovak Mathematical Journal,
vol. 72
(2022),
issue 1,
pp. 59-77
Mohar, Bojan; Poljak, Svatopluk:
Eigenvalues and the max-cut problem.
(English).Czechoslovak Mathematical Journal,
vol. 40
(1990),
issue 2,
pp. 343-352
Brualdi, Richard A.; Liu, Bo Lian:
Hall exponents of Boolean matrices.
(English).Czechoslovak Mathematical Journal,
vol. 40
(1990),
issue 4,
pp. 659-670
Nešetřil, Jaroslav; Poljak, Svatopluk:
On the complexity of the subgraph problem.
(English).Commentationes Mathematicae Universitatis Carolinae,
vol. 26
(1985),
issue 2,
pp. 415-419
Graovac, Ante; Jashari, Gani; Strunje, Mate:
On the distance spectrum of a cycle.
(English).Aplikace matematiky,
vol. 30
(1985),
issue 4,
pp. 286-290