Tree- and forest-perfect graphs
From MaRDI portal
Publication:1302153
DOI10.1016/S0166-218X(99)00071-2zbMATH Open0941.05029OpenAlexW2094774242MaRDI QIDQ1302153FDOQ1302153
Authors: 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
Recommendations
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75) Perfect graphs (05C17)
Cited In (9)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
- Note on Perfect Forests in Digraphs
- Superperfect pairs of trees in graphs
- Title not available (Why is that?)
- Forests and trees among Gallai graphs
- Bipartite-perfect graphs
- Graphs with at most two trees in a forest-building process
- Counting spanning trees using modular decomposition
- Perfect trees and elementary embeddings
This page was built for publication: Tree- and forest-perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1302153)