• DML-CZ Home

Author: Nebeský, Ladislav

• Nebeský, Ladislav: On the distance function of a connected graph. (English). Czechoslovak Mathematical Journal, vol. 58 (2008), issue 4, pp. 1101-1106
• Nebeský, Ladislav: A new approach to chordal graphs. (English). Czechoslovak Mathematical Journal, vol. 57 (2007), issue 1, pp. 465-471
• Nebeský, Ladislav: The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 2, pp. 317-338
• Nebeský, Ladislav: Signpost systems and spanning trees of graphs. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 3, pp. 885-893
• Nebeský, Ladislav: Travel groupoids. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 2, pp. 659-675
• Nebeský, Ladislav: On signpost systems and connected graphs. (English). Czechoslovak Mathematical Journal, vol. 55 (2005), issue 2, pp. 283-293
• Nebeský, Ladislav: The directed geodetic structure of a strong digraph. (English). Czechoslovak Mathematical Journal, vol. 54 (2004), issue 1, pp. 1-8
• Nebeský, Ladislav: On properties of a graph that depend on its distance function. (English). Czechoslovak Mathematical Journal, vol. 54 (2004), issue 2, pp. 445-456
• Nebeský, Ladislav: Hamiltonian colorings of graphs with long cycles. (English). Mathematica Bohemica, vol. 128 (2003), issue 3, pp. 263-275
• Nebeský, Ladislav: The induced paths in a connected graph and a ternary relation determined by them. (English). Mathematica Bohemica, vol. 127 (2002), issue 3, pp. 397-408
• Nebeský, Ladislav: New proof of a characterization of geodetic graphs. (English). Czechoslovak Mathematical Journal, vol. 52 (2002), issue 1, pp. 33-39
• Nebeský, Ladislav: A characterization of the interval function of a (finite or infinite) connected graph. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 3, pp. 635-642
• Nebeský, Ladislav: The interval function of a connected graph and a characterization of geodetic graphs. (English). Mathematica Bohemica, vol. 126 (2001), issue 1, pp. 247-254
• Nebeský, Ladislav: An axiomatic approach to metric properties of connected graphs. (English). Czechoslovak Mathematical Journal, vol. 50 (2000), issue 1, pp. 3-14
• Nebeský, Ladislav: A theorem for an axiomatic approach to metric properties of graphs. (English). Czechoslovak Mathematical Journal, vol. 50 (2000), issue 1, pp. 121-133
• Nebeský, Ladislav: A tree as a finite nonempty set with a binary operation. (English). Mathematica Bohemica, vol. 125 (2000), issue 4, pp. 455-458
• Nebeský, Ladislav: An algebraic characterization of geodetic graphs. (English). Czechoslovak Mathematical Journal, vol. 48 (1998), issue 4, pp. 701-710
• Nebeský, Ladislav: Characterizing the interval function of a connected graph. (English). Mathematica Bohemica, vol. 123 (1998), issue 2, pp. 137-144
• Nebeský, Ladislav: A new proof of a characterization of the set of all geodesics in a connected graph. (English). Czechoslovak Mathematical Journal, vol. 48 (1998), issue 4, pp. 809-813
• Nebeský, Ladislav: Geodesics and steps in a connected graph. (English). Czechoslovak Mathematical Journal, vol. 47 (1997), issue 1, pp. 149-161
• Nebeský, Ladislav: On the set of all shortest paths of a given length in a connected graph. (English). Czechoslovak Mathematical Journal, vol. 46 (1996), issue 1, pp. 155-160
• Nebeský, Ladislav: Certain cubic multigraphs and their upper embeddability. (English). Czechoslovak Mathematical Journal, vol. 45 (1995), issue 3, pp. 385-392
• Nebeský, Ladislav: A characterization of geodetic graphs. (English). Czechoslovak Mathematical Journal, vol. 45 (1995), issue 3, pp. 491-493
• Nebeský, Ladislav: A characterization of the decay number of a connected graph. (English). Mathematica Slovaca, vol. 45 (1995), issue 4, pp. 349-352
• Nebeský, Ladislav: Visibilities and sets of shortest paths in a connected graph. (English). Czechoslovak Mathematical Journal, vol. 45 (1995), issue 3, pp. 563-570
• Nebeský, Ladislav: A characterization of the interval function of a connected graph. (English). Czechoslovak Mathematical Journal, vol. 44 (1994), issue 1, pp. 173-178
• Nebeský, Ladislav: A characterization of the set of all shortest paths in a connected graph. (English). Mathematica Bohemica, vol. 119 (1994), issue 1, pp. 15-20
• Nebeský, Ladislav: Route systems of a connected graph. (English). Mathematica Bohemica, vol. 119 (1994), issue 4, pp. 407-414
• Nebeský, Ladislav: Characterizing the maximum genus of a connected graph. (English). Czechoslovak Mathematical Journal, vol. 43 (1993), issue 1, pp. 177-185
• Nebeský, Ladislav: Local properties and upper embeddability of connected multigraphs. (English). Czechoslovak Mathematical Journal, vol. 43 (1993), issue 2, pp. 241-248
• Nebeský, Ladislav: A matching and a Hamiltonian cycle of the fourth power of a connected graph. (English). Mathematica Bohemica, vol. 118 (1993), issue 1, pp. 43-52
• Nebeský, Ladislav: $N_2$-locally connected graphs and their upper embeddability. (English). Czechoslovak Mathematical Journal, vol. 41 (1991), issue 4, pp. 731-735
• Nebeský, Ladislav: Route systems and bipartite graphs. (English). Czechoslovak Mathematical Journal, vol. 41 (1991), issue 2, pp. 260-264
• Nebeský, Ladislav: On certain extensions of intervals in graphs. (English). Časopis pro pěstování matematiky, vol. 115 (1990), issue 2, pp. 171-177
• Nebeský, Ladislav: Embedding $m$-quasistars into $n$-cubes. (English). Czechoslovak Mathematical Journal, vol. 38 (1988), issue 4, pp. 705-712
• Nebeský, Ladislav: Hypergraphs and intervals. III. (English). Časopis pro pěstování matematiky, vol. 113 (1988), issue 1, pp. 80-87
• Nebeský, Ladislav: On a $1$-factor of the fourth power of a connected graph. (English). Časopis pro pěstování matematiky, vol. 113 (1988), issue 4, pp. 415-420
• Nebeský, Ladislav: On 2-cell embeddings of graphs with minimum numbers of regions. (English). Czechoslovak Mathematical Journal, vol. 35 (1985), issue 4, pp. 625-631
• Nebeský, Ladislav: On locally quasiconnected graphs and their upper embeddability. (English). Czechoslovak Mathematical Journal, vol. 35 (1985), issue 1, pp. 162-166
• Nebeský, Ladislav; Wisztová, Elena: Two edge-disjoint Hamiltonian cycles of powers of a graph. (English). Časopis pro pěstování matematiky, vol. 110 (1985), issue 3, pp. 294-301
• Nebeský, Ladislav: Edge-disjoint 1-factors in powers of connected graphs. (English). Czechoslovak Mathematical Journal, vol. 34 (1984), issue 4, pp. 499-505
• Nebeský, Ladislav: Hypergraphs and intervals. II. (English). Časopis pro pěstování matematiky, vol. 109 (1984), issue 3, pp. 286-289
• Nebeský, Ladislav: On quasistars in $n$-cubes. (English). Časopis pro pěstování matematiky, vol. 109 (1984), issue 2, pp. 153-156
• Nebeský, Ladislav: Upper embeddable factorizations of graphs. (English). Czechoslovak Mathematical Journal, vol. 34 (1984), issue 3, pp. 432-438
• Nebeský, Ladislav: A note on upper embeddable graphs. (English). Czechoslovak Mathematical Journal, vol. 33 (1983), issue 1, pp. 37-40
• Nebeský, Ladislav: On a certain numbering of the vertices of a hypergraph. (English). Czechoslovak Mathematical Journal, vol. 33 (1983), issue 1, pp. 1-6
• Nebeský, Ladislav: On upper embeddability of complementary graphs. (English). Časopis pro pěstování matematiky, vol. 108 (1983), issue 2, pp. 214-217
• Nebeský, Ladislav: Algebraic properties of Husimi trees. (English). Časopis pro pěstování matematiky, vol. 107 (1982), issue 2, pp. 116-123
• Nebeský, Ladislav: Hypergraphs and intervals. (English). Czechoslovak Mathematical Journal, vol. 31 (1981), issue 3, pp. 469-474
• Nebeský, Ladislav: A new characterization of the maximum genus of a graph. (English). Czechoslovak Mathematical Journal, vol. 31 (1981), issue 4, pp. 604-613
• Nebeský, Ladislav: On $1$-factors in the cube of a graph. (English). Časopis pro pěstování matematiky, vol. 106 (1981), issue 3, pp. 226-230
• Nebeský, Ladislav; Wisztová, Elena: Regular factors in powers of connected graphs. (English). Časopis pro pěstování matematiky, vol. 106 (1981), issue 1, pp. 52-59
• Nebeský, Ladislav: On squares of complementary graphs. (English). Mathematica Slovaca, vol. 30 (1980), issue 3, pp. 247-249
• Nebeský, Ladislav: On the existence of a $3$-factor in the fourth power of a graph. (English). Časopis pro pěstování matematiky, vol. 105 (1980), issue 2, pp. 204-207
• Nebeský, Ladislav: On 2-factors in squares of graphs. (English). Czechoslovak Mathematical Journal, vol. 29 (1979), issue 4, pp. 588-594
• Nebeský, Ladislav: On eulerian subgraphs of complementary graphs. (English). Czechoslovak Mathematical Journal, vol. 29 (1979), issue 2, pp. 298-302
• Nebeský, Ladislav: On the existence of 1-factors in partial squares of graphs. (English). Czechoslovak Mathematical Journal, vol. 29 (1979), issue 3, pp. 349-352
• Nebeský, Ladislav: On pancyclic line graphs. (English). Czechoslovak Mathematical Journal, vol. 28 (1978), issue 4, pp. 650-655
• Nebeský, Ladislav: On partition graphs and generalizations of line graphs. (English). Časopis pro pěstování matematiky, vol. 102 (1977), issue 2, pp. 203-205
• Nebeský, Ladislav: An upper bound for the minimum degree of a graph. (English). Czechoslovak Mathematical Journal, vol. 27 (1977), issue 3, pp. 460-466
• Nebeský, Ladislav: A generalization of Hamiltonian cycles for trees. (English). Czechoslovak Mathematical Journal, vol. 26 (1976), issue 4, pp. 596-603
• Nebeský, Ladislav: On the minimum degree and edge-connectivity of a graph. (English). Časopis pro pěstování matematiky, vol. 101 (1976), issue 2, pp. 199-202
• Nebeský, Ladislav: On tree-complete graphs. (English). Časopis pro pěstování matematiky, vol. 100 (1975), issue 4, pp. 334-338
• Nebeský, Ladislav: A theorem on $2$-connected graphs. (English). Časopis pro pěstování matematiky, vol. 100 (1975), issue 2, pp. 116-117
• Nebeský, Ladislav: A note on line graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 15 (1974), issue 3, pp. 567-570
• Nebeský, Ladislav: On cubes and dichotomic trees. (English). Časopis pro pěstování matematiky, vol. 99 (1974), issue 2, pp. 164-167
• Nebeský, Ladislav: Reconstruction of a tree from certain maximal proper subtrees. (English). Časopis pro pěstování matematiky, vol. 99 (1974), issue 1, pp. 44-48
• Nebeský, Ladislav: On connected graphs containing exactly two points of the same degree. (English). Časopis pro pěstování matematiky, vol. 98 (1973), issue 3, pp. 305-306
• Nebeský, Ladislav: On the line graph of the square and the square of the line graph of a connected graph. (English). Časopis pro pěstování matematiky, vol. 98 (1973), issue 3, pp. 285-287
• Nebeský, Ladislav: On the minimum number of vertices and edges in a graph with a given number of spanning trees. (English). Časopis pro pěstování matematiky, vol. 98 (1973), issue 1, pp. 95-97
• Nebeský, Ladislav: An outerplanar test of linguistic projectivity. (English). Kybernetika, vol. 9 (1973), issue 2, pp. (81)-83
• Nebeský, Ladislav: A theorem on Hamiltonian line graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 14 (1973), issue 1, pp. 107-112
• Nebeský, Ladislav: Planar permutation graphs of paths. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 13 (1972), issue 2, pp. 253-256
• Nebeský, Ladislav: A planar test of linguistic projectivity. (English). Kybernetika, vol. 8 (1972), issue 4, pp. (351)-354
• Nebeský, Ladislav: Median graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 12 (1971), issue 2, pp. 317-325
• Nebeský, Ladislav: On one of the boundaries of the constituent conception of grammar. (English). Kybernetika, vol. 7 (1971), issue 3, pp. (227)-229
• Nebeský, Ladislav: Graphic algebras. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 11 (1970), issue 3, pp. 533-544