Vertex partitions of graphs into cographs and stars
DOI10.1002/JGT.21724zbMATH Open1280.05104OpenAlexW1495584351MaRDI QIDQ2874091FDOQ2874091
Authors: Paul Dorbec, Mickaël Montassier, Pascal Ochem 
Publication date: 28 January 2014
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21724
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- A Linear Recognition Algorithm for Cographs
- Improper choosability of graphs and maximum average degree
- List strong linear 2-arboricity of sparse graphs
- Partitions of graphs into cographs
- On \(P_4\)-transversals of chordal graphs
- Title not available (Why is that?)
- The complexity of \(G\)-free colourability
Cited In (13)
- Excluding pairs of graphs
- Generalizing cographs to 2-cographs
- The adjacency matrix of a graph as a data table: a geometric perspective
- On the computational complexity of the bipartizing matching problem
- Cographs whose complements consist of \(k\)-partite components
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions
- Partitioning a graph into disjoint cliques and a triangle-free graph
- On symbolic ultrametrics, cotree representations, and cograph edge decompositions and partitions
- Partitioning cographs into two forests and one independent set
- Co-2-plex vertex partitions
- Partitions of graphs into cographs
- Star Partitions of Perfect Graphs
- Characterizing –partitionable Cographs
This page was built for publication: Vertex partitions of graphs into cographs and stars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874091)
