Partitioning cographs into two forests and one independent set

DOI10.1007/978-3-030-39219-2_2zbMATH Open1460.05155OpenAlexW3001825526MaRDI QIDQ779168FDOQ779168

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

Publication date: 21 July 2020

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

Recommendations

• Vertex arboricity of cographs
• Partitioning cographs into cliques and stable sets
• Characterizing –partitionable Cographs
• Vertex partitions of graphs into cographs and stars
• Polar cographs

zbMATH Keywords

partitioncolouringvertex arboricitycographforbidden subgraph characterizationindependent vertex feedback set

Mathematics Subject Classification ID

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

Cited In (5)

• Excluding pairs of graphs
• Vertex partitions of graphs into cographs and stars
• Minimal obstructions to 2-polar cographs
• Title not available (Why is that?)
• Partitioning cographs into cliques and stable sets

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

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