Původní matematické (•) a matematicky orientované (=) práce 

A. Kniha, kapitoly v knihách

• Algebraic Properties of Trees (Postscript P. Novák). AUC Philologica Monographia 25, Praha 1969. 
• The minimum degree and connectivity of a graph. In: (F. Alavi, D. R.Lick, eds.) Theory and Applications of Graphs. Springer-Verlag 1978, s. 412-419.
• On a diffusion of a set of vertices in a connected graph. In: (M. Fiedler, ed.) Graphs and Other Combinatorial Topics. Teubner, Leipzig 1983, s. 200-203.

B. Články

• Language systems. RRMPA 13, 1968, 371-375. 
= On a possible application of pushdown-store transducers. PBML 9, 1968, 47-68 a PBML 10, 1968, 3-27. (S A. Goralčíkovou)
• Graphic algebras. CMUC 11, 1970, 533-544. 
• Left-right double trees. DM 1, 1971, 73-81. 
• Median graphs. CMUC 12, 1971, 317-325.
= A projectivity theorem. PSML 3, 1972, 165-169.
= A planar test of linguistic projectivity. K 8, 1972, 351-353.
• Planar permutation graphs of paths. CMUC 13, 1972, 253-256. 
= An outerplanar test of linguistic projectivity. K 9, 1973, 81-83.
• On the minimum number of vertices and edges in a graph with a given number of spanning trees. ČPM 98, 1973, 95-97.
• A theorem on hamiltonian line graphs. CMUC 14, 1973, 107-112.
• On connected graphs containing exactly two points of the same degree. ČPM 98, 1973, 305-306. 
• On the line graph of the square and the square of the line graph of a connected graph. ČPM 98, 1973, 285-287.
• A note on line graphs. CMUC 15, 1974, 567-570.
• On cubes and dichotomic trees. ČPM 99, 1974, 164-167.
• Reconstruction of a tree from certain maximal proper subtrees. ČPM 99, 1974, 44-48.
• A theorem on line graphs. In: Recent Advantages in Graph Theory. Academia, Praha 1975, 399-403. 
• A theorem on 2-connected graphs. ČPM 100, 1975, 116-117.
• On tree-complete graphs. ČPM 100, 1975, 334-338.
• A generalization of hamiltonian cycles for trees. CMJ 26, 1976, 596-603.
• On the minimum degree and edge-connectivity of a graph. PM 101, 1976, 199-202.
• Projective weakly connected digraphs with no directed cycle. RRMPA 21, 1976, 215-217.
= Projectivity in linguistics and planarity in graph theory. PSML 5, 1976, 251-256.
• On the existence of a 3-connected 3-factor in powers of a connected graph. In: Graphs, Hypergraphs and Block Systems. Zeliona Góra 1976, s. 167-172.
• An upper bound for the minimum degree of a graph. CMJ 27, 1977, 460-466.
• On partition graphs and generalization of line graphs. ČPM 102, 1977, 203-205.
• On induced subgraphs of a block. JGT 1, 1977, 69-74.
= A projectivity theorem for weakly connected digraphs. PSML 6, 1978, 209-213.
• On pancyclic line graphs. CMJ 23, 1978, 650-655..
• Some sufficient conditions for the existence of a 1-factor. JGT 2, 1978, 251-255.
• A note on 1-factors in graphs. PMH 10, 1979, 41-46. (s G. Chartrandem).
• On the existence of a 1-factor in partial squares of graphs. CMJ 29, 1979, 349-352.
• On 2-factors in squares of graphs. CMJ 29, 1979, 588-593.
• On eulerian subgraphs of complementary graphs. CMJ 29, 1979, 298- 302.
• On the existence of a 3-factor in the fourth power of a graph. ČPM 105, 1980, 204-207.
• On the square of complementary graphs. MS 3, 1980, 247-249.
= Projectivity as a minimalization. PBML 34, 1980, 59-63.
• Every connected, locally connected graph is upper embeddable. JGT 5, 1981, 5-7.
• Regular factors of powers of connected graphs. ČPM 106, 1981, 52-57. (s E. Wisztovou) 
• On 1-factors in the cube of a graph. ČPM 106, 1981, 226-230.
• Hypergraphs and intervals. CMJ 31, 1981, 469-474.
• A new characterization of the maximum genus of a graph. CMJ 31, 1981, 604-613.
= On projective trees. PSML 7, 1981, 167-172.
• Algebraic properties of Husimi trees. ČPM 107, 1982, 116-123.
• A note on upper embeddable graphs. CMJ 33, 1983, 37-40.
• On a certain numbering of the vertices of a hypergraph. CMJ 33, 1983, 1-6.
• On upper embeddability of complementary graphs. ČPM 108, 1983, 214-217.
• Hypergraphs and intervals, II. ČPM 109, 1984, 286-289.
• On quasistars in n-cubes. ČPM 109, 1984, 153-156.
• Upper embedable factorizations of graphs. CMJ 34, 1984, 432-438.
• Edge disjoint 1-factors in powers of connected graphs. CMJ 34, 1984, 499-505.
• Two edge-disjoint hamiltonian cycles of powers of a graph. ČPM 110, 1985, 294-301. (s E. Wisztovou)
• On locally connected graphs and their upper embeddability. CMJ 35, 1985, 625-631.
• On 2-cell embeddings with minimum number of regions. CMJ 35, 1985, 625- 631.
= On projectivity and antiprojectivity. PSML 9, 1986, 119-123.
• Hypergraphs and intervals, III. ČPM 113, 1988, 80-87.
• On a 1-factor of the fourh power of a connected graph. ČPM 113, 1988, 415-420.
•Embedding m-quasistars into n-cubes. CMJ 38, 1988, 705-712.
• On certain extensions of intervals in graphs. ČPM 115, 1990, 171- 177.
• Route systems and bipartite graphs. CNJ 41, 1991, 260-264.
• N2-locally connected graphs and their upper embeddability. CMJ 41, 1991, 731-735.
• On sectors in a connected graph. In: Combinatorics, Graphs, Complexity (M. Fiedler, J. Nešetřil, eds.), a volume of Annals of Discrete Mathematics. North Holland 1992, s. 237-240.
• A matching and a hamiltonian cycle of the fourth power of a connected graph. MB 118, 1993, 43-52. 
• Characterizing the maximum genus of a connected multigraph. CMJ 43, 1993, 177-185.
• Local properties and upper embeddability of connected multigraphs. CMJ 43, 1993, 241-248.
• A characterization of the set of all shortest paths in a connected graph. MB 119, 1994, 15-20.
• A characterization of the interval function of a connected graph. CMJ 44 (119), 1994, 173-178.
• Route systems of a connected graph. MB 119, 1994, 407-414.
• Certain cubic multigraphs and their upper embeddability. CMJ 44 (120), 1995, 385-392.
• A characterization of geodetic graphs. CMJ 44 (120), 1995, 491- 493. 
• Visibilities and sets of shortest paths in a connected graph. CMJ 44 (120), 1995, 563-570.
• A characterization of the decay number of a connected graph. MS 45, 1995, 349-352.
• On the set of all shortest paths of a given length in a connected graph. CMJ 46 (121), 1996, 155-160.
• On geodesics and steps in a connected graph. CMJ 47 (122), 1997, 49-161.
• Characterizing the interval function of a connected graph. MB 23, 1998.
• An algebraic characterization of geodetic graphs. CMJ 48 (123), 1998, 701-710. 
• A new proof of a characterization of the set of all geodesics in a connected graph. CMJ 48 (123), 1998, 809-813. 
• An axiomatic approach to metric properties of connected graphs. CMJ 50 (125), 2000, 3-14. 
• A theorem for an axiomatic approach to metric properties of graphs. CMJ 50 (125), 2000, 121-133. 
• A tree as a finite nonempty set with a binary operation. MB 125, 2000, 455-458. 
•The interval function of a connected graph and a characterization of geodetic graphs. MB 126, 2001, 247-254. 
• The set of geodesics in a graph. DM (235) 2001, 323-326. 
• A characterization of the interval function of a (finite or infinite) connected graph. CMJ 51 (126) 2001, 635-642.
• New proof of as characterization of geodetic graphs. CMJ 52 (127) 2002, 35-39.
• The induced paths in a connected graph and a ternary relation determined by them. MB (127) 2002, 397-408.
• Bounds for the hamiltonian chromatic number of a graph. CN 157,  2002, 113-125 (with G. Chartrand and P. Zhang).
• Hamiltonian colorings of graphs with long cycles. MB 128, 2003, 263-275.
• Modular and median signpost systems and their underlying graphs. DMGT 23, 2003, 309- 324 (with H. M. Mulder)
• Greedy F-colorings of graphs. DM 272,  2003, 37-46 (with G. Chartrand and P. Zhang).
• On properties of a graph that depend on the distance function. CMJ 54 (129), 2004, 445-456.
• Intervals and steps in a connected graph. DM 286,  2004, 151- 156. MB2005:03071
• Radio k-colorings of paths. DMGT 24, 2004, 137-144 (with G. Chartrand and P. Zhang).
• The directed geodetic structure of a strong digraph. CMJ 54 (129), 2004, 1-8.
• Intervals and steps in a connected graph. DM 286, 2004, 151-156.
• Survey on hamiltonian colorings of graphs. CN 169, 2004, 79-192 (with G. Chartrand and P. Zhang).
• Hamiltonian colorings of graphs. DAM 146, 2005, 257-272. (with G. Chartrand and P. Zhang).
• On hamiltonian colorings of graphs. DM 290,  2005, 133-143 (with G. Chartrand and P. Zhang).
• On signpost systems and connected graphs. CMJ 55 (130), 2005, 283-293.
• The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraph. CMJ 56(131), 2006, 317-338.
• Travel groupoids, CMJ 56 (131), 2006, 659 – 675.
• Signpost systems and spaning trees of graphs. CMJ 56 (131), 2006, 885- 893
• Leaps: An approach to the block structure of a graph. DMGT 26 (2006), 77 – 90. (with H. M. Mulder).
• New approch to chordal graphs. CMJ 57 (132),  2007,465- 471.
• Distance defined by spanning trees in graphs. GT 27, 2007, 485-506 (with G. Chartrand and P. Zhang)
• The interval function of a connected graph and road systems. DM 307, 2007, 2067-2073.
• On the distance function of a connected graph. CMJ 58 (133) 2008, 1101-1106.
• On Hamiltonian colorings and hc-stable graphs. CN 189, 2008, 65-76 (with B.M. Algerier, G. Chartrand, A. S. Jobson, P. Zhang).
• Axiomatic characterization of the interval function of a graph. EJC 30, 2009, 1172-1185. (with H. M. Mulder).
• Distance-hereditary graphs and signpost systems. DM 310, 2010, 527 – 530.
• Guides and Shortcuts in Graphs. DM 313, 2013, 1897 -1907 (with  H. M. Mulder).

Zkratky:

CMJ: Czechoslovak Mathematical Journal
CMUC: Commentationes Mathematicae Universitatis Carolinae
CN: Congressus Numerantium
ČPM: Časopis pro pěstování matematiky
DAM: Discrete Applied Mathematics
DM: Discrete Mathematics
DMGT: Discussiones Mathematicae Graph Theory
EJC: European Journal of Combinatorics
JGT: Journal of Graph Theory
K: Kybernetika
MB: Mathematica Bohemica
MS: Mathematica Slovaca
PBML: The Prague Bulletin of Mathematical Linguistics
PMH: Periodica Math. Hungarica
PSML: Prague Studies in Mathematical Linguistics
RRMPA: Revue roumaine mathématique pures et appliques