Self-complementary factors of almost complete tripartite graphs of even order (Q5959095)
From MaRDI portal
scientific article; zbMATH DE number 1722215
Language | Label | Description | Also known as |
---|---|---|---|
English | Self-complementary factors of almost complete tripartite graphs of even order |
scientific article; zbMATH DE number 1722215 |
Statements
Self-complementary factors of almost complete tripartite graphs of even order (English)
0 references
24 November 2002
0 references
An almost complete tripartite graph \(k_{a,b,c}\) is a complete tripartite graph without one edge. The graph \(k_{a,b,c}\) is called \(d\)-halvable if it can be decomposed into two isomorphic factors with a given diameter \(d\). The author proves that if the graph \(k_{a,b,c}\) is \(d\)-halvable for a finite \(d\), then \(d\leq 5\). Also, all triples \(a\), \(b\), \(c\) with an even sum are determined for which a \(d\)-halvable almost complete bipartite graph \(k_{a,b,c}\) where \(d= 3\), \(4\), or \(5\) exists.
0 references
factors
0 references
decomposition
0 references
tripartite graph
0 references