The well-covered dimension of products of graphs

DOI10.7151/DMGT.1770zbMath1303.05164arXiv1003.3968OpenAlexW2963340282MaRDI QIDQ472139

Isaac Birnbaum, Robyn McDonald, Katherine Urabe, Megan Kuneli, Oscar Vega

Publication date: 18 November 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.3968

zbMATH Keywords

maximal independent setswell-covered dimension

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vector spaces, linear dependence, rank, lineability (15A03) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Computing well-covered vector spaces of graphs using modular decomposition ⋮ Well-covered graphs without cycles of lengths 4, 5 and 6

Cites Work

• On the well-coveredness of Cartesian products of graphs
• The uniformity space of hypergraphs and its applications
• Local Structure When All Maximal Independent Sets Have Equal Weight
• Well-Covered Vector Spaces of Graphs
• Some covering concepts in graphs

This page was built for publication: The well-covered dimension of products of graphs