A note on graphs with characteristic-dependent well-covered dimension
classification
🧮 math.CO
keywords
graphscharacteristic-dependentdimensionwell-coveredconstructedinvestigateknownnote
read the original abstract
We investigate graphs that have characteristic-dependent well-covered dimension and show how more of these graphs can be constructed from known ones.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.