EuDML | Browse

The paper deals with the problem how to locate a set of polygon vertices on given circles fulfilling some criteria of "regularity" of individual and composed polygons. Specifying the conditions we can obtain a lot of particular versions of this general problem. Some of them are already solved, the others are not. Applications of this theory can be found in scheduling of periodically repeating processes, e.g. in coordination of several urban lines on a common leg, in optimization of the rhythm of...

Location-domatic number of a graph

Bohdan Zelinka (1998)

Mathematica Bohemica

A subset $D$ of the vertex set $V (G)$ of a graph $G$ is called locating-dominating, if for each $x \in V (G) - D$ there exists a vertex $y \to D$ adjacent to $x$ and for any two distinct vertices $x_{1}$ , $x_{2}$ of $V (G) - D$ the intersections of $D$ with the neighbourhoods of $x_{1}$ and $x_{2}$ are distinct. The maximum number of classes of a partition of $V (G)$ whose classes are locating-dominating sets in $G$ is called the location-domatic number of $G .$ Its basic properties are studied.

It is shown that every 3-connected planar graph with a large number of vertices has a long induced path.

Currently displaying 141 – 160 of 188

Previous Page 8 Next

Displaying 141 – 160 of 188

Locally toroidal regular polytopes of rank 4.

Locally tree-like graphs

Locally Truncated Buildings and M.... .

Locally-cyclic graphs covering complete tripartite graphs

Location of polygon vertices on circles and its application in transport studies

Location-domatic number of a graph

Logarithmic components of the vacant set for random walk on a discrete torus.

Log-balanced combinatorial sequences.

Logconcave random graphs.

Logics of bipartite graphs and complete multipartite graphs

Lokální vlastnosti grafů

Long cycles and neighborhood union in 1-tough graphs with large degree sums

Long cycles in certain graphs of large degree.

Long heterochromatic paths in edge-colored graphs.

Long induced paths in 3-connected planar graphs

Long path lemma concerning connectivity and independence number.

Longest alternating subsequences in pattern-restricted permutations.

Longest circuits in triangular and quadrangular $3$ -polytopes with two types of edges

Longest cycles in certain bipartite graphs.

Longest increasing subsequences in pattern-restricted permutations.

Currently displaying 141 – 160 of 188