A quick way to verify if a graph is 3-colorable
type: Item
instance of: scholarly article
title: A quick way to verify if a graph is 3-colorable
author: Narda Cordero-Michel
author: Hortensia Galeana-Sánchez
published in: Discrete Applied Mathematics
publication date: 2024-11-06T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 7939384
zbMATH Keywords: proper coloring of a graph
zbMATH Keywords: chromatic number
zbMATH Keywords: nonseparable graph
MaRDI profile type: Publication
cites work: Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
cites work: Q5422499
cites work: Q5782525
cites work: Coloring digraphs with forbidden cycles
cites work: Cycles and new bounds for the chromatic number
cites work: Graph coloring approach with new upper bounds for the chromatic number: team building application
cites work: Bounding χ in terms of ω and Δ for quasi-line graphs
cites work: An upper bound for the chromatic number of line graphs
cites work: Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)
cites work: Q4242948
cites work: Q4000231
cites work: Graph coloring in linear time
DOI: 10.1016/J.DAM.2024.07.039
description: scientific article; zbMATH DE number 7939384