Two classes of -perfect graphs that do not necessarily have simplicial extremes

DOI10.1016/J.DISC.2021.112374MaRDI QIDQ2032702zbMATH OpenOpenAlexFDO

Authors Jake Horsfield, Kristina Vušković

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

\( \beta \)-perfect grapheven-hole-free graphgreedy coloring algorithmno simplicial extreme

Mathematics Subject Classification ID

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

Recommendations

• A class of -perfect graphs
• -perfect graphs
• Two classes of perfect graphs
• On edge perfectness and classes of bipartite graphs
• On some graph classes related to perfect graphs: a survey
• A characterization of b-perfect graphs
• A characterization of \(\Gamma\alpha(k)\)-perfect graphs
• Characterization of \(b\gamma\)-perfect graphs
• Extremal perfect graphs for a bound on the domination number
• scientific article; zbMATH DE number 3893228

Cites work

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

Cited in

(3)

• A class of -perfect graphs
• -perfect graphs
• Conditions for β-perfectness

This page was built for publication: Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes

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