\(P_n\)-induced-saturated graphs exist for all \(n \geqslant 6\)

DOI10.37236/9579zbMath1454.05100OpenAlexW3112691972MaRDI QIDQ2215464

Vojtěch Dvořák

Publication date: 13 December 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/9579

zbMATH Keywords

induced subgraphssaturationBoolean formulas

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• Graphs with induced-saturation number zero
• Induced saturation number
• A survey of minimum saturated graphs
• Induced saturation of graphs
• On induced saturation for paths

This page was built for publication: \(P_n\)-induced-saturated graphs exist for all \(n \geqslant 6\)