No label defined (Q3693541)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3918397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3918397 |
Statements
1984
0 references
1-factorization
0 references
regular graphs
0 references
factors
0 references
line-graphs
0 references
0.808831512928009
0 references
0.7931286096572876
0 references
[For the entire collection see Zbl 0559.00001.] Sufficient conditions for the 1-factorability of various graph products are presented. In particular \(G_ 1\cdot G_ 2\cdot...\cdot G_ r\) with regular factors is 1-factorable if at least one of the factors \(G_ i\) is 1-factorable. The dot denotes the cartesian, lexicographic, tensor or strong product, all defined in the paper. For the cartesian and lexicographic product it is sufficient that two of the factors contain a 1-factor. For the cartesian product this is due to \textit{A. Kotzig} [J. Graph Theory 3, 23-34 (1979; Zbl 0395.05059)]. Some sufficient conditions for 1-factorability of the graph G(m), obtained from G by replacing each vertex of G by m independent vertices, are given. The conjecture that G(m) is 1-factorable when G is regular and \(m\cdot | V(G)|\) is even (m\(\geq 2)\), is announced to be false by a counterexample of M. Truszczyński. Some further results, in particular on line-graphs, are given.
0 references