The well-covered dimension of random graphs

DOI10.1016/j.disc.2005.09.026zbMath1110.05089OpenAlexW2150983673MaRDI QIDQ864120

Richard J. Nowakowski, Jason I. Brown

Publication date: 13 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.026

zbMATH Keywords

vector space

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Well-dominated graphs without cycles of lengths 4 and 5, Partitions and well-coveredness: the graph sandwich problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of well covered graphs of girth 5 or greater
• The uniformity space of hypergraphs and its applications
• Well-covered graphs and extendability
• The structure of well-covered graphs and the complexity of their recognition problems
• Recursively decomposable well-covered graphs
• Well-covered claw-free graphs
• Local Structure When All Maximal Independent Sets Have Equal Weight
• WELL-COVERED GRAPHS: A SURVEY
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• Well-Covered Vector Spaces of Graphs
• Some covering concepts in graphs