EuDML | Browse

Page 1

Displaying 1 – 5 of 5

Jamming and geometric representations of graphs.

Krauth, Werner, Loebl, Martin (2006)

The Electronic Journal of Combinatorics [electronic only]

Ještě o kostrách souvislých grafů

Jiří Sedláček (1979)

Časopis pro pěstování matematiky

Join graphs of trees

Bohdan Zelinka (1980)

Czechoslovak Mathematical Journal

Join of two graphs admits a nowhere-zero $3$ -flow

Saieed Akbari, Maryam Aliakbarpour, Naryam Ghanbari, Emisa Nategh, Hossein Shahmohamad (2014)

Czechoslovak Mathematical Journal

Let $G$ be a graph, and $λ$ the smallest integer for which $G$ has a nowhere-zero $λ$ -flow, i.e., an integer $λ$ for which $G$ admits a nowhere-zero $λ$ -flow, but it does not admit a $(λ - 1)$ -flow. We denote the minimum flow number of $G$ by $Λ (G)$ . In this paper we show that if $G$ and $H$ are two arbitrary graphs and $G$ has no isolated vertex, then $Λ (G \lor H) \leq 3$ except two cases: (i) One of the graphs $G$ and $H$ is $K_{2}$ and the other is $1$ -regular. (ii) $H = K_{1}$ and $G$ is a graph with at least one isolated vertex or a component whose every block is an...

Just Two Total Graphs are Complementary.

F. Escalante, J.M.S. Simoes-Pereira (1976)

Monatshefte für Mathematik