Partitioning cographs into two forests and one independent set

DOI10.1007/978-3-030-39219-2_2zbMath1460.05155OpenAlexW3001825526MaRDI QIDQ779168

César Hernández-Cruz, Pavol Hell, Anurag Sanyal

Publication date: 21 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39219-2_2

zbMATH Keywords

partitioncolouringvertex arboricitycographforbidden subgraph characterizationindependent vertex feedback set

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: Partitioning cographs into two forests and one independent set