Alternating connectivity of tournaments

Bohdan Zelinka

Displaying similar documents to “Alternating connectivity of tournaments”

Alternating connectivity of digraphs

Bohdan Zelinka (1971)

Časopis pro pěstování matematiky

Similarity:

Even bonds of prescribed directed parity.

Hartmann, Sven, Little, C.H.C. (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Rainbow Vertex-Connection and Forbidden Subgraphs

Wenjing Li, Xueliang Li, Jingshu Zhang (2018)

Discussiones Mathematicae Graph Theory

Similarity:

A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them. For a connected graph G, the rainbow vertex-connection number of G, denoted by rvc(G), is defined as the minimum number of colors that are required to make G rainbow vertex-connected. In this paper, we find all the families ℱ of connected...

Geodetic graphs of diameter two

Bohdan Zelinka (1975)

Czechoslovak Mathematical Journal

Similarity: