Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs

Andrea Munaro, Shizhou Yang, Esther Galby

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

This page was built for publication: Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs

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