Well-Covered Vector Spaces of Graphs

DOI10.1137/S0895480101393039zbMath1104.05052MaRDI QIDQ5470803

Jason I. Brown, Richard J. Nowakowski

Publication date: 1 June 2006

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

dimensionindependentweighting

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

The structure of well-covered graphs with no cycles of length 4 ⋮ The well-covered dimension of random graphs ⋮ Well-dominated graphs without cycles of lengths 4 and 5 ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ Well-covered graphs with constraints on \(\Delta\) and \(\delta\) ⋮ The well-covered dimension of products of graphs ⋮ Vertex-transitive CIS graphs ⋮ Complexity results for generating subgraphs ⋮ Recognizing Generating Subgraphs Revisited

This page was built for publication: Well-Covered Vector Spaces of Graphs