First-fit colorings of graphs with no cycles of a prescribed even length

DOI10.1007/s10878-015-9900-zzbMath1348.05087OpenAlexW412662211MaRDI QIDQ326475

Manouchehr Zaker, Hossein Soltani

Publication date: 12 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9900-z

zbMATH Keywords

graph coloringGrundy numberfirst-fit coloring algorithm

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Bounds for the Grundy chromatic number of graphs in terms of domination number ⋮ More bounds for the Grundy number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the Grundy chromatic number of graphs
• Asymptotic lower bounds for Ramsey functions
• Coloring inductive graphs on-line
• On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
• Cycles of even length in graphs
• Inequalities for the Grundy chromatic number of graphs
• On the Grundy Number of a Graph
• On the First-Fit Chromatic Number of Graphs
• Inequalities for the first-fit chromatic number
• On-line and first fit colorings of graphs
• Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
• On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $

This page was built for publication: First-fit colorings of graphs with no cycles of a prescribed even length