Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes
type: Item
instance of: scholarly article
title: Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes
zbMATH Open document ID: 1466.05080
author: Jake Horsfield
author: Kristina Vušković
published in: Discrete Mathematics
publication date: 2021-06-14T00:00:00Z
Mathematics Subject Classification ID: 05C17
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7358310
zbMATH Keywords: \( \beta \)-perfect graph
zbMATH Keywords: even-hole-free graph
zbMATH Keywords: greedy coloring algorithm
zbMATH Keywords: no simplicial extreme
MaRDI profile type: Publication
full work available at URL: j.disc.2021.112374
OpenAlex ID: W3152149987
cites work: Clique‐cutsets beyond chordal graphs
cites work: Structure and algorithms for (cap, even hole)-free graphs
cites work: Even and odd holes in cap-free graphs
cites work: On rigid circuit graphs
cites work: A class of \(\beta\)-perfect graphs
cites work: Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
cites work: \(\beta\)-perfect graphs
cites work: Static frequency assignment in cellular networks
DOI: 10.1016/J.DISC.2021.112374
Recommended article: A class of \(\beta\)-perfect graphs
Recommended article: \(\beta\)-perfect graphs
Recommended article: Two classes of perfect graphs
Recommended article: On edge perfectness and classes of bipartite graphs
Recommended article: On some graph classes related to perfect graphs: a survey
Recommended article: A characterization of \(b\)-perfect graphs
Recommended article: A characterization of \(\Gamma\alpha(k)\)-perfect graphs
Recommended article: Characterization of \(b\gamma\)-perfect graphs
Recommended article: Extremal perfect graphs for a bound on the domination number
Recommended article: Q5184933
description: scientific article; zbMATH DE number 7358310