Seznam původních matematických (•) a matematicky orientovaných (=) prací L. Nebeského. Je uveden i údaj o referátu Mathematical Review (MR), pokud je autorovi znám.

A. Kniha

Algebraic Properties of Trees (Postscript P. Novák). AUC Philologica Monographia 25, Praha 1969. MR 42 :: 9085.

B. Články

• Language systems. RRMPA 13, 1968, 371-375. MR 39 :: 2547.
 = On a possible application of pushdown-store transducers. PBML 9, 1968, 47-68 a PBML 10, 1968, 3-27. (Spolu s A. Goralčíkovou)
• Graphic algebras. CMUC 11, 1970, 533-544. MR 42 :: 3006.
• Left-right double trees. DM 1, 1971, 73-81. MR 45 :: 6674.
• Median graphs. CMUC 12, 1971, 317-325. MR 44 :: 3914.
= A projectivity theorem. PSML 3, 1972, 165-169. MR 57 :: 14630 a,b.
= A planar test of linguistic projectivity. K 8, 1972, 351-353. MR 56 :: 10174.
• Planar permutation graphs of paths. CMUC 13, 1972, 253-256. MR 46 :: 7096.
= An outerplanar test of linguistic projectivity. K 9, 1973, 81-83. MR 56 :: 101175.
• On the minimum number of vertices and edges in a graph with a given number of spanning trees. ČPM 98, 1973, 95-97. MR 47 :: 6547.
• A theorem on hamiltonian line graphs. CMUC 14, 1973, 107-112. MR 52 :: 2956.
• On connected graphs containing exactly two points of the same degree. ČPM 98, 1973, 305-306. MR 48 :: 180.
• On the line graph of the square and the square of the line graph of a connected graph. ČPM 98, 1973, 285-287. MR 48 :: 1986.
• A note on line graphs. CMUC 15, 1974, 567-570. MR 50 :: 4404.
• On cubes and dichotomic trees. ČPM 99, 1974, 164-167. MR 50 :: 6903.
10M
• Reconstruction of a tree from certain maximal proper subtrees. ČPM 99, 1974, 44-48. MR 50 :: 4360.
• A theorem on line graphs. V: Recent Advantages in Graph Theory. Academia, Praha 1975, s. 399-403. MR 52 :: 2956.
• A theorem on 2-connected graphs. ČPM 100, 1975, 116-117. MR 55 :: 2653.
• On tree-complete graphs. ČPM 100, 1975, 334-338. MR 52 :: 2956.
• A generalization of hamiltonian cycles for trees. CMJ 26, 1976, 596-603. MR 56 :: 27579.
• On the minimum degree and edge-connectivity of a graph. PM 101, 1976, 199-202. MR 56 :: 8409.
• Projective weakly connected digraphs with no directed cycle. RRMPA 21, 1976, 215-217. MR 55 :: 7830.
= Projectivity in linguistics and planarity in graph theory. PSML 5, 1976, 251-256. MR 58 :: 32108.
• On the existence of a 3-connected 3-factor in powers of a connected graph. V: 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. MR 57 :: 5836.
• On partition graphs and generalization of line graphs. ČPM 102, 1977, 203-205. MR 57 :: 3008.
20M
• On induced subgraphs of a block. JGT 1, 1977, 69-74. MR 58 :: 21857.
= A projectivity theorem for weakly connected digraphs. PSML 6, 1978, 209-213. MR 80a: 05104.
• The minimum degree and connectivity of a graph. V: Theory and Applications of Graphs (F. Alavi, D.R.Lick, eds.), Springer-Verlag 1978, s. 412-419.
• On pancyclic line graphs. CMJ 23, 1978, 650-655. MR 80a: 05137.
• Some sufficient conditions for the existence of a 1-factor. JGT 2, 1978, 251-255. MR 80a: 05170.
• A note on 1-factors in graphs. PMH 10, 1979, 41-46. (Spolu s G. Chartrandem) MR 58 :: 21834.
• On the existence of a 1-factor in partial squares of graphs. CMJ 29, 1979, 349-352. MR 81b: 05098.
• On 2-factors in squares of graphs. CMJ 29, 1979, 588-593. MR 81h:05106.
• On eulerian subgraphs of complementary graphs. CMJ 29, 1979, 298- 302. MR 80g: 05048.
• On the existence of a 3-factor in the fourth power of a graph. ČPM 105, 1980, 204-207. MR 81f: 05130.
• On the square of complementary graphs. MS 3, 1980, 247-249. MR 81m: 05112.
30M
= Projectivity as a minimalization. PBML 34, 1980, 59-63. MR 82g: 68072.
• Every connected, locally connected graph is upper embeddable. JGT 5, 1981, 5-7. MR 82e: 05064.
• Regular factors of powers of connected graphs. ČPM 106, 1981, 52-57. (Spolu s E. Wisztovou) MR g: 05074.
• On 1-factors in the cube of a graph. ČPM 106, 1981, 226-230. MR 83a: 05111.
• Hypergraphs and intervals. CMJ 31, 1981, 469-474. MR 83c: 05106.
• A new characterization of the maximum genus of a graph. CMJ 31, 1981, 604-613. MR 82j: 05053.
= On projective trees. PSML 7, 1981, 167-172. MR 83d: 05036.
• Algebraic properties of Husimi trees. ČPM 107, 1982, 116-123. MR 83m: 05051.
• A note on upper embeddable graphs. CMJ 33, 1983, 37-40. MR 84g: 05057.
• On a certain numbering of the vertices of a hypergraph. CMJ 33, 1983, 1-6. MR 84i: 05085.
• On upper embeddability of complementary graphs. ČPM 108, 1983, 214-217. MR 84m: 05027.
• On a diffusion of a set of vertices in a connected graph. V: Graphs and Other Combinatorial Topics (M. Fiedler, ed.). Teubner, Leipzig 1983, s. 200-203. MR 85e: 05102.
40M
• Hypergraphs and intervals, II. ČPM 109, 1984, 286-289.MR 86j: 05104.
• On quasistars in n-cubes. ČPM 109, 1984, 153-156. MR 85i: 05082.
• Upper embedable factorizations of graphs. CMJ 34, 1984, 432-438. MR 86k: 05045.
• Edge disjoint 1-factors in powers of connected graphs. CMJ 34, 1984, 499-505. MR 86a: 05100.
• Two edge-disjoint hamiltonian cycles of powers of a graph. ČPM 110, 1985, 294-301. (Spolu s E. Wisztovou) MR 87?: 05089.
• On locally connected graphs and their upper embeddability. CMJ 35, 1985, 625-631. MR 86e: 05033.
• On 2-cell embeddings with minimum number of regions. CMJ 35, 1985, 625- 631. MR 87e: 05062.
= On projectivity and antiprojectivity. PSML 9, 1986, 119-123. MR 88i: 05140.
• Hypergraphs and intervals, III. ČPM 113, 1988, 80-87. MR 89f: 05131.
• On a 1-factor of the fourh power of a connected graph. ČPM 113, 1988, 415-420. MR 89m: 05094.
•Embedding m-quasistars into n-cubes. CMJ 38, 1988, 705-712. MR 90c: 05069.
50M
• On certain extensions of intervals in graphs. ČPM 115, 1990, 171- 177. MR 91i: 05074.
• Route systems and bipartite graphs. CNJ 41, 1991, 260-264. MR 92g: 05118.
• N2-locally connected graphs and their upper embeddability. CMJ 41, 1991, 731-735. MR 92j: 05063.
• On sectors in a connected graph. V: Combinatorics, Graphs, Complexity (M. Fiedler, J. Nešetřil, eds.), a volume of Annals of Discrete Mathematics. North Holland 1992, s. 237-240. MR 94g:05031.
• A matching and a hamiltonian cycle of the fourth power of a connected graph. MB 118, 1993, 43-52. MR 94b: 05131.
• Characterizing the maximum genus of a connected multigraph. CMJ 43, 1993, 177-185. MR 94b: 05065.
• Local properties and upper embeddability of connected multigraphs. CMJ 43, 1993, 241-248. MR 84b: 05066.
• A characterization of the set of all shortest paths in a connected graph. MB 119, 1994, 15-20. MR 95i: 05081.
• A characterization of the interval function of a connected graph. CMJ 44 (119), 1994, 173-178. MR 95g: 05065.
• Route systems of a connected graph. MB 119, 1994, 407-414. MR 96d: 05070.
60M
• Certain cubic multigraphs and their upper embeddability. CMJ 44 (120), 1995, 385-392. MR 96h: 05059.
• A characterization of geodetic graphs. CMJ 44 (120), 1995, 491- 493. MR 96i: 05146
• Visibilities and sets of shortest paths in a connected graph. CMJ 44 (120), 1995, 563-570. MR 96f: 05069.
• A characterization of the decay number of a connected graph. MS 45, 1995, 349-352. MR 97a: 05174.
• On the set of all shortest paths of a given length in a connected graph. CMJ 46 (121), 1996, 155-160. MR 97d: 05184.
• On geodesics and steps in a connected graph. CMJ 47 (122), 1997, 49-161. MR 97k: 05064.
• Characterizing the interval function of a connected graph. MB 23, 1998. MR 2000j: 05099.
• An algebraic characterization of geodetic graphs. CMJ 48 (123), 1998, 701-710. MR 2000d: 05105
• A new proof of a characterization of the set of all geodesics in a connected graph. CMJ 48 (123), 1998, 809-813. MR 2000e: 05099
• An axiomatic approach to metric properties of connected graphs. CMJ 50 (125), 2000, 3-14. MR 2000k: 05106
70M
• A theorem for an axiomatic approach to metric properties of graphs. CMJ 50 (125), 2000, 121-133. MR 2000k: 05105
• A tree as a finite nonempty set with a binary operation. MB 125 (2000), 455-458. MR 2001m: 05090
•The interval function of a connected graph and a characterization of geodetic graphs. MB 126, 2001, 247-254. MR 2002g: ?
• The set of geodesics in a graph. DM 235 (2001), 323-326. MR 2002a(?): 05085
• A characterization of the interval function of a (finite or infinite) connected graph. CMJ 51 (126) (2001), 635-642. MR 2003d: 05067.
• 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)
80M
• 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, 179—192. Spoluautoři: G. Chartrand a P. Zhang,
• Hamiltonian colorings of graphs. DAM 146, 2005, 257—272. S Spoluautoři: G. Chartrand a P. Zhang.
• On hamiltonian colorings of graphs. Discrete Mathematics 290, 2005, 133—143.. Spoluautoři: G. Chartrand a P. Zhang.
• On signpost systems and connected graphs. CMJ 55 (130),2005, 283—293.
90M
• 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. Spoluautor: H. M. Mulder.
• New approch to chordal graphs. CMJ 57 (132), 2007,465 – 471.
• 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. Spoluautoři: B.M. Algerier, G. Chartrand, A.S. Jobson, P. Zhang
• Axiomatic characterization of the interval function of a graph. EJC 30 (2009) 1172 – 1185. Spoluautor: H. M. Mulder
• Distance-hereditary graphs and signpost systems. DM 310 (2010) 527 – 530.
100M
 

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

 

Comments are closed.