\(\beta\)-perfect graphs

DOI10.1006/jctb.1996.0030zbMath0857.05038OpenAlexW2036522563MaRDI QIDQ1924134

Yanyan Li

Publication date: 14 October 1996

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1996.0030

zbMATH Keywords

greedy algorithmchromatic numberperfect graphsminimum degreecolor

Mathematics Subject Classification ID

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

Related Items (18)

Linear recognition of pseudo-split graphs ⋮ On realization graphs of degree sequences ⋮ Vertex coloring of graphs with few obstructions ⋮ Universally signable graphs ⋮ Structure and algorithms for (cap, even hole)-free graphs ⋮ On the structure of (pan, even hole)‐free graphs ⋮ Decremental optimization of vertex-coloring under the reconfiguration framework ⋮ On the forbidden induced subgraph sandwich problem ⋮ Unnamed Item ⋮ More bounds for the Grundy number of graphs ⋮ On the structure of (even hole, kite)-free graphs ⋮ Even-hole-free graphs part I: Decomposition theorem ⋮ On lower bounds for the chromatic number in terms of vertex degree ⋮ Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes ⋮ Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences ⋮ A class of \(\beta\)-perfect graphs ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure ⋮ Even-hole-free graphs part II: Recognition algorithm

This page was built for publication: \(\beta\)-perfect graphs