Search

Start Over Coverage 45-63

2. Festivity vesnické komunity z pohledu školních kronik. Sondy do záznamů školních kronik vybraných lokalit z konce 19. století

Creator:
Valešová, Barbora and Kuthanová, Veronika
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
chronicle, school, festivity, teacher, and students
Language:
Czech
Description:
Spreading of school chronicles in the second half of the 19th century allows collection of information from larger geographic areas.Despite being significantly different in terms of length and nature of records, individual chronicles represent a valuable source of information for researchers. Authors of the chronicles were teachers, through whom we find out more about the lives of school children, troubles of teachers in the 19th century or about disputes accompanying attempts to build own schools in municipalities, but also about municipalities themselves, national and international events and natural disasters.The paper focused on festivities in a social group of the municipality from the perspective of school chronicles as a unique and not quite yet explored source. Thanks to these records, it is possible to rebuild the course of official visits of high state and church representatives, sanctification of buildings or celebrations of Christmas trees, but mainly the position of the school and its involvement in social life. Thanks to the chronological recording, the development of the festive life in the municipality can be observed, and despite the fact that it is primarily a source from the school environment, information recorded in it is of indisputable importance for the creation of a complex view of the culture and life in a municipality in the 19th century.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

3. The k-metric colorings of a graph

Creator:
Fujie-Okamoto, Futaba, Renzema, Willem, and Zhang, Ping
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
detour distance and metric coloring
Language:
English
Description:
For a nontrivial connected graph G of order n, the detour distance D(u, v) between two vertices u and v in G is the length of a longest u − v path in G. Detour distance is a metric on the vertex set of G. For each integer k with 1 ≤ k ≤ n−1, a coloring c : V (G) → N is a k-metric coloring of G if |c(u) − c(v)| + D(u, v) ≥ k + 1 for every two distinct vertices u and v of G. The value χ k m(c) of a k-metric coloring c is the maximum color assigned by c to a vertex of G and the k-metric chromatic number χ k m(G) of G is the minimum value of a k-metric coloring of G. For every nontrivial connected graph G of order n, χ 1m(G) ≤ χ 2m(G) ≤ . . . ≤ χ n−1 m (G). Metric chromatic numbers provide a generalization of several well-studied coloring parameters in graphs. Upper and lower bounds have been established for χ k m(G) in terms of other graphical parameters of a graph G and exact values of k-metric chromatic numbers have been determined for complete multipartite graphs and cycles. For a nontrivial connected graph G, the anti-diameter adiam(G) is the minimum detour distance between two vertices of G. We show that the adiam(G)-metric chromatic number of a graph G provides information on the Hamiltonian properties of the graph and investigate realization results and problems on this parameter.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public