@article{cdf534f9c1f14579a3e80c14506b6757,
title = "Characterizations of bipartite Steinhaus graphs",
abstract = "We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion had previously been given for the number of bipartite Steinhaus graphs and we give two fascinating closed forms for this recursion. Also, we exhibit a lower bound, which is achieved infinitely often, for the number of bipartite Steinhaus graphs.",
author = "Chang, {Gerard J.} and Bhaskar DasGupta and Dym{\`a}{\v c}ek, {Wayne M.} and Martin F{\"u}rer and Matthew Koerlin and Lee, {Yueh Shin} and Tom Whaley",
note = "Funding Information: * Corresponding author. E-mail:
[email protected]. {\textquoteright} Supported in part by the National Science Council under grant NSC83-0208-M009-050. {\textquoteright} Research supported in part by NSF grant CCR-92-00270. {\textquoteright} Research supported in part by a Washington and Lee University Glenn Grant. 4 Research supported in part by NSF grants CCR-92-18309, CCR-9700053. {\textquoteright} Research supported in part by a Council on Undergraduate Research Summer Opportunities Fellowship Award. {\textquoteleft}This paper contains parts of Y.S. Lee{\textquoteright}s master thesis,",
year = "1999",
month = mar,
day = "28",
doi = "10.1016/S0012-365X(98)00282-9",
language = "English (US)",
volume = "199",
pages = "11--25",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier B.V.",
number = "1-3",
}