A graph is well-covered if every maximal independent set has the same cardinality, namely the vertex independence number. We answer a question of Topp and Volkmann and prove that if the Cartesian product of two graphs is well-covered, then at least one of them must be well-covered.
@article{10_37236_2299,
author = {Bert L Hartnell and Douglas F Rall},
title = {On the {Cartesian} product of non well-covered graphs},
journal = {The electronic journal of combinatorics},
year = {2013},
volume = {20},
number = {2},
doi = {10.37236/2299},
zbl = {1266.05133},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2299/}
}
TY - JOUR
AU - Bert L Hartnell
AU - Douglas F Rall
TI - On the Cartesian product of non well-covered graphs
JO - The electronic journal of combinatorics
PY - 2013
VL - 20
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/2299/
DO - 10.37236/2299
ID - 10_37236_2299
ER -
%0 Journal Article
%A Bert L Hartnell
%A Douglas F Rall
%T On the Cartesian product of non well-covered graphs
%J The electronic journal of combinatorics
%D 2013
%V 20
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/2299/
%R 10.37236/2299
%F 10_37236_2299
Bert L Hartnell; Douglas F Rall. On the Cartesian product of non well-covered graphs. The electronic journal of combinatorics, Tome 20 (2013) no. 2. doi: 10.37236/2299
