Coloring bull-free perfect graphs

DOI10.1137/110825637zbMATH Open1256.05083OpenAlexW2128302269MaRDI QIDQ4899063FDOQ4899063

Authors: Irena Penev 

Publication date: 4 January 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110825637

Recommendations

• Optimizing Bull-Free Perfect Graphs
• Recognizing bull-free perfect graphs
• The structure of bull-free perfect graphs
• 4-coloring \((P_6, \text{bull})\)-free graphs
• Coloring Bull-Free Perfectly Contractile Graphs

zbMATH Keywords

graph algorithmsgraph coloringperfect graphsbull-free graphs

Mathematics Subject Classification ID

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)

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
• Title not available (Why is that?)
• 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)