On the well-coveredness of Cartesian products of graphs
From MaRDI portal
Publication:998514
DOI10.1016/J.DISC.2007.12.083zbMATH Open1229.05239OpenAlexW2138524324MaRDI QIDQ998514FDOQ998514
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)
Cites Work
Cited In (15)
- Partitions and well-coveredness: the graph sandwich problem
- Recognizing well covered graphs of families with special \(P _{4}\)-components
- Title not available (Why is that?)
- On \(k\)-rainbow independent domination in graphs
- Title not available (Why is that?)
- On the Cartesian product of non well-covered graphs
- The well-covered dimension of products of graphs
- Well-hued graphs
- The Cover Time of Cartesian Product Graphs
- On well-covered direct products
- Independent Roman \(\{2 \}\)-domination in graphs
- Characterization of the Cartesian product of complete graphs by convex subgraphs
- On well-covered Cartesian products
- Independent double Roman domination in graphs
- Title not available (Why is that?)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- The well-covered dimension of products of graphs 👍 👎
- On well-covered Cartesian products 👍 👎
- On the gonality of Cartesian products of graphs 👍 👎
- On the connectivity of Cartesian product of graphs 👍 👎
- On linkedness in the Cartesian product of graphs 👍 👎
- On the Cartesian product of non well-covered graphs 👍 👎
This page was built for publication: On the well-coveredness of Cartesian products of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998514)
