Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs
type: Item
instance of: scholarly article
title: Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs
zbMATH Open document ID: 1475.05068
author: Uttam K. Gupta
author: D. Pradhan
published in: Journal of Applied Mathematics and Computing
publication date: 2021-11-29T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 7435199
zbMATH Keywords: \((P_5, C_4)\)-free graphs
MaRDI profile type: Publication
full work available at URL: s12190-020-01419-3
OpenAlex ID: W3047417012
Wikidata QID: Q123004326
cites work: Q5782525
cites work: On an upper bound of the graph's chromatic number, depending on the graph's degree and density
cites work: Graphs with $\chi=\Delta$ Have Big Cliques
cites work: Coloring Claw-Free Graphs with $\Delta-1$ Colors
cites work: Note on the colouring of graphs
cites work: Improvement on Brooks' chromatic bound for a class of graphs
cites work: Q4857375
cites work: The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\)
cites work: Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)
cites work: Q3909076
cites work: Graphs with chromatic number close to maximum degree
cites work: A strengthening of Brooks' theorem
cites work: Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
DOI: 10.1007/S12190-020-01419-3
description: scientific article; zbMATH DE number 7435199