First-fit colorings of graphs with no cycles of a prescribed even length
type: Item
instance of: scholarly article
title: First-fit colorings of graphs with no cycles of a prescribed even length
zbMATH Open document ID: 1348.05087
author: Manouchehr Zaker
author: Hossein Soltani
published in: Journal of Combinatorial Optimization
publication date: 2016-10-12T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6637632
zbMATH Keywords: graph coloring
zbMATH Keywords: first-fit coloring algorithm
zbMATH Keywords: Grundy number
MaRDI profile type: Publication
full work available at URL: s10878-015-9900-z
OpenAlex ID: W412662211
cites work: On the First-Fit Chromatic Number of Graphs
cites work: Q4830805
cites work: Cycles of even length in graphs
cites work: Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
cites work: Inequalities for the first-fit chromatic number
cites work: On-line and first fit colorings of graphs
cites work: On the Grundy Number of a Graph
cites work: Coloring inductive graphs on-line
cites work: On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
cites work: Q4010310
cites work: Q5387684
cites work: On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
cites work: Asymptotic lower bounds for Ramsey functions
cites work: Q4659607
cites work: Results on the Grundy chromatic number of graphs
cites work: Inequalities for the Grundy chromatic number of graphs
DOI: 10.1007/S10878-015-9900-Z
description: scientific article; zbMATH DE number 6637632