Flows on the join of two graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F13%3A43919960" target="_blank" >RIV/49777513:23520/13:43919960 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Flows on the join of two graphs

Original language description

We prove that the join of two graphs admits a nowhere-zero 3-flow except for a few classes of graphs: a single vertex joined with a graph containing an isolated vertex or an odd circuit tree component, a single edge joined with a graph containing only isolated edges, a single edge plus an isolated vertex joined with a graph containing only isolated vertices, and two isolated vertices joined with exactly one isolated vertex plus some number of isolated edges.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/EE2.3.30.0013" target="_blank" >EE2.3.30.0013: Excellence in human resources as a source of competitiveness</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2013

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Mathematica Bohemica

ISSN

0862-7959

e-ISSN

—

Volume of the periodical

138

Issue of the periodical within the volume

4

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

14

Pages from-to

383-396

UT code for WoS article

—

EID of the result in the Scopus database

—