Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes

DOI10.1016/j.disc.2021.112374zbMath1466.05080OpenAlexW3152149987MaRDI QIDQ2032702

Kristina Vušković, Jake Horsfield

Publication date: 14 June 2021

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

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112374

zbMATH Keywords

greedy coloring algorithmeven-hole-free graph\( \beta \)-perfect graphno simplicial extreme

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Cites Work

• On rigid circuit graphs
• Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
• A class of \(\beta\)-perfect graphs
• Structure and algorithms for (cap, even hole)-free graphs
• \(\beta\)-perfect graphs
• Even and odd holes in cap-free graphs
• Clique‐cutsets beyond chordal graphs
• Static frequency assignment in cellular networks