Non-perfect \((P_5, C_5, K_5 -e)\)-free graphs are 5-colorable
type: Item
instance of: scholarly article
title: Non-perfect \((P_5, C_5, K_5 -e)\)-free graphs are 5-colorable
author: Yian Xu
published in: Graphs and Combinatorics
publication date: 2025-01-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05Axx
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7964497
zbMATH Keywords: \(P_5\)
zbMATH Keywords: \(K_5 -e\)
zbMATH Keywords: chromatic number
zbMATH Keywords: clique number
MaRDI profile type: Publication
cites work: Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs
cites work: Perfect coloring and linearly χ-boundP6-free graphs
cites work: The strong perfect graph theorem
cites work: \(K_{4}\)-free graphs with no odd holes
cites work: Perfect divisibility and 2‐divisibility
cites work: On the chromatic number of some \(P_5\)-free graphs
cites work: Graph Theory and Probability
cites work: Q4190662
cites work: Ramsey-type theorems
cites work: The chromatic number of \(\{P_5,K_4\}\)-free graphs
cites work: Coloring the hypergraph of maximal cliques of a graph with no long path
cites work: Q4063176
cites work: Q5749319
cites work: Two cases of polynomial-time solvability for the coloring problem
cites work: Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
cites work: A survey of χ‐boundedness
cites work: Polynomial bounds for chromatic number II: Excluding a star‐forest
cites work: Q3932997
cites work: χ‐bounds, operations, and chords
cites work: The chromatic number of (\(P_5\), HVN)-free graphs
cites work: Coloring graphs without induced \(P_5\) or \(K_5-e\)
DOI: 10.1007/S00373-024-02866-6
description: scientific article; zbMATH DE number 7964497