Chromatic number of \(P_5\)-free graphs: Reed's conjecture (Q279215)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Chromatic number of \(P_5\)-free graphs: Reed's conjecture	scientific article

Statements

scholarly article

Chromatic number of \(P_5\)-free graphs: Reed's conjecture (English)

Ingo Schiermeyer

Discrete Mathematics

publication date

27 April 2016

zbMATH Keywords

chromatic number

chi-binding function

P5-free graph

Reed's conjecture

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.disc.2015.11.020

Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs

Dominating cliques in \(P_ 5\)-free graphs

The strong perfect graph theorem

The chromatic number of \(\{P_5,K_4\}\)-free graphs

On graphs without \(P_ 5\) and \(\overline {P}_ 5\)

An upper bound for the chromatic number of line graphs

Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)

A Note On Reed's Conjecture

Identifiers

zbMATH Open document ID

Mathematics Subject Classification ID

zbMATH DE Number

10.1016/J.DISC.2015.11.020

Sitelinks

Mathematics(1 entry)

mardi Publication:279215

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q279215&oldid=38289604"