P_n-induced-saturated graphs exist for all n 6

DOI10.37236/9579zbMATH Open1454.05100OpenAlexW3112691972MaRDI QIDQ2215464FDOQ2215464

Authors: 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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• On induced saturation for paths
• Induced saturation of \(P_6\)
• Induced Subgraph Saturated Graphs
• Induced saturation of graphs
• \(P_m\)-saturated graphs with minimum size

zbMATH Keywords

saturationinduced subgraphsBoolean formulas

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

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

Cited In (4)

• Induced saturation of graphs
• On induced saturation for paths
• Induced saturation of \(P_6\)
• Induced Subgraph Saturated Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215464)