68E10
- : On a generalization of perfect $b$-matching. (English). Mathematica Bohemica, vol. 116 (1991), issue 4, pp. 380-384
- : On polynomial time decidability of induced-minor-closed classes. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 29 (1988), issue 4, pp. 703-710
- : On the computational complexity of centers locating in a graph. (English). Aplikace matematiky, vol. 25 (1980), issue 6, pp. 445-452
- : A characterization of hypergraphs generated by arborescences. (English). Kybernetika, vol. 15 (1979), issue 6, pp. (403)-407
Search
Partner of
