"In this paper, we give some sufficient conditions for distance local connectivity of a graph, and a degree condition for local connectivity of a k-connected graph with large diameter. We study some relationships between t-distance chromatic number and distance local connectivity of a graph and give an upper bound on the t-distance chromatic number of a k-connected graph with diameter d."@en . "RIV/49777513:23520/07:00000121!RIV08-MSM-23520___" . "23520" . . . "O distan\u010Dn\u00ED lok\u00E1ln\u00ED souvislosti a distan\u010Dn\u00EDm barven\u00ED vrchol\u016F"@cs . "1"^^ . "Holub, P\u0159emysl" . "209" . . "P(1M0545), Z(MSM4977751301)" . . "On distance local connectivity and vertex distance colouring" . . "O distan\u010Dn\u00ED lok\u00E1ln\u00ED souvislosti a distan\u010Dn\u00EDm barven\u00ED vrchol\u016F"@cs . . "1234-3099" . . . "19"^^ . . "439214" . . . . "On distance local connectivity and vertex distance colouring"@en . "PL - Polsk\u00E1 republika" . "On distance local connectivity and vertex distance colouring" . "V tomto \u010Dl\u00E1nku uv\u00E1d\u00EDme posta\u010Duj\u00EDc\u00ED podm\u00EDnky pro distan\u010Dn\u00ED lok\u00E1ln\u00ED souvislost grafu a podm\u00EDnky na stupn\u011B pro lok\u00E1ln\u00ED souvislost v k-souvisl\u00E9m grafu s velk\u00FDm pr\u016Fm\u011Brem. D\u00E1le zkoum\u00E1me vztahy mezi \u010D\u00EDslem distan\u010Dn\u00ED lok\u00E1ln\u00ED souvislosti a t-distan\u010Dn\u00EDm chromatick\u00FDm \u010D\u00EDslem grafu, a uv\u00E1d\u00EDme horn\u00ED odhad pro t-distan\u010Dn\u00ED chromatick\u00E9 \u010D\u00EDslo k-souvisl\u00E9ho grafu s pr\u016Fm\u011Brem d."@cs . . "[626FF13DC03D]" . "0" . . "degree condition; distance local connectivity; distance chromatic number"@en . . "Discussiones Mathematicae. Graph Theory" . . "In this paper, we give some sufficient conditions for distance local connectivity of a graph, and a degree condition for local connectivity of a k-connected graph with large diameter. We study some relationships between t-distance chromatic number and distance local connectivity of a graph and give an upper bound on the t-distance chromatic number of a k-connected graph with diameter d." . . "RIV/49777513:23520/07:00000121" . "1"^^ . "On distance local connectivity and vertex distance colouring"@en .