Coloring Bull-Free Perfect Graphs

DOI10.1137/110825637zbMath1256.05083OpenAlexW2128302269MaRDI QIDQ4899063

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

zbMATH Keywords

graph coloringgraph algorithmsperfect graphsbull-free graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17) Signed and weighted graphs (05C22)

Related Items (3)

The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs ⋮ 4-coloring \((P_6, \text{bull})\)-free graphs ⋮ 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