Coloring Bull-Free Perfectly Contractile Graphs

DOI10.1137/06065948XMaRDI QIDQ3544248zbMATH OpenOpenAlexFDO

Authors Benjamin Lévêque, Frédéric Maffray

Publication date 5 December 2008

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

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

zbMATH Keywords

perfect graphcoloringbull-free graphLexBFS

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Recommendations

• On the structure of bull-free perfect graphs
• Bull-free weakly chordal perfectly orderable graphs
• Optimizing Bull-Free Perfect Graphs
• Coloring bull-free perfect graphs
• On the structure of bull-free perfect graphs. II: The weakly chordal case

Cited in

(6)

• Colouring vertices of triangle-free graphs without forests
• Bull-free weakly chordal perfectly orderable graphs
• The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
• Coloring bull-free perfect graphs
• The structure of bull-free perfect graphs
• Optimizing Bull-Free Perfect Graphs

This page was built for publication: Coloring Bull-Free Perfectly Contractile Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3544248)