Coloring bull-free perfect graphs
From MaRDI portal
Publication:4899063
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22) Structural characterization of families of graphs (05C75) Perfect graphs (05C17)
Recommendations
Cited in
(10)- Improved FPT algorithms for weighted independent set in bull-free graphs
- The maximum weight stable set problem in (\(P_6\), bull)-free graphs
- Bull-free Berge graphs are perfect
- Coloring Bull-Free Perfectly Contractile Graphs
- 4-coloring \((P_6, \text{bull})\)-free graphs
- Solving the clique cover problem on (bull, \(C_4\))-free graphs
- Optimizing Bull-Free Perfect Graphs
- Recognizing bull-free perfect graphs
- scientific article; zbMATH DE number 1033812 (Why is no real title available?)
- Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs
This page was built for publication: Coloring bull-free perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899063)