On the well-coveredness of Cartesian products of graphs
From MaRDI portal
Publication:998514
DOI10.1016/j.disc.2007.12.083zbMath1229.05239OpenAlexW2138524324MaRDI QIDQ998514
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.083
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Recognizing well covered graphs of families with special \(P _{4}\)-components, Well-hued graphs, Independent Roman \(\{2 \}\)-domination in graphs, On the Cartesian product of non well-covered graphs, Independent double Roman domination in graphs, The well-covered dimension of products of graphs, On well-covered Cartesian products, On \(k\)-rainbow independent domination in graphs, Partitions and well-coveredness: the graph sandwich problem, On well-covered direct products
Cites Work