Halving complete 4-partie graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F00%3A00012458" target="_blank" >RIV/61989100:27240/00:00012458 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Halving complete 4-partie graphs

Original language description

The spectrum of complete 4-partite graphs with at most one odd part which are decomposable into two isomorphic factors with a finite diameter is determined. For complete 4-partite graphs with all parts odd the spectrum problem for factors with diameter 5is completely solved. As regards the remaining possible finite diameters, 2, 3, 4, partial results are presented, focusing on decompositions of graphs with partite sets of two different odd orders.

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/GA201%2F98%2F1451" target="_blank" >GA201/98/1451: Special graph, hypergraph and algorithmic structures</a><br>

Continuities

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

Publication year

2000

Confidentiality

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

Name of the periodical

Ars Combinatoria

ISSN

005-7825

e-ISSN

—

Volume of the periodical

—

Issue of the periodical within the volume

55

Country of publishing house

CA - CANADA

Number of pages

10

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—