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:
		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:
		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:
		An algebraic characterization of geodetic graphs.
		
			(English).
Czechoslovak Mathematical Journal,
		vol. 48
			(1998),
			issue 4,
		pp. 701-710
- 
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:
		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:
		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:
		$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:
		Embedding $m$-quasistars into $n$-cubes.
		
			(English).
Czechoslovak Mathematical Journal,
		vol. 38
			(1988),
			issue 4,
		pp. 705-712
- 
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:
		Edge-disjoint 1-factors in powers of connected graphs.
		
			(English).
Czechoslovak Mathematical Journal,
		vol. 34
			(1984),
			issue 4,
		pp. 499-505
- 
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:
		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 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:
		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
 
Partner of
