Tree- and forest-perfect graphs

DOI10.1016/S0166-218X(99)00071-2zbMath0941.05029OpenAlexW2094774242MaRDI QIDQ1302153

Andreas Brandstädt, Van Bang Le

Publication date: 22 September 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00071-2

zbMATH Keywords

perfect graphscharacterizations of graphsgeneralizations of isomorphism

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Related Items (4)

The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes ⋮ Counting spanning trees using modular decomposition ⋮ Unnamed Item ⋮ Bipartite-perfect graphs

This page was built for publication: Tree- and forest-perfect graphs