Small 2-factors of bipartite graphs. (Q2716007)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Small 2-factors of bipartite graphs. |
scientific article; zbMATH DE number 1600975
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Small 2-factors of bipartite graphs. |
scientific article; zbMATH DE number 1600975 |
Statements
20 July 2005
0 references
2-factor
0 references
bipartite graph
0 references
spectrum
0 references
Latin square
0 references
Small 2-factors of bipartite graphs. (English)
0 references
A 2-factor of a graph \(G\) is called small if it consists of \(\lfloor \frac {| V(G)| }{2}\rfloor \) cycles. The authors study the spectrum of maximal sets of small 2-factors.
0 references
0.8193647265434265
0 references
0.8000320196151733
0 references
0.7935441732406616
0 references
0.7935441732406616
0 references
0.793059229850769
0 references
