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

DOI10.1007/S10878-015-9900-ZzbMATH Open1348.05087OpenAlexW412662211MaRDI QIDQ326475FDOQ326475

Authors: 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

Recommendations

• Inequalities for the first-fit chromatic number
• On the First-Fit Chromatic Number of Graphs
• \((\delta, \chi_{\mathsf{FF}})\)-bounded families of graphs
• Inequalities for the Grundy chromatic number of graphs
• First-fit chromatic numbers of \(d\)-degenerate graphs

zbMATH Keywords

graph coloringGrundy numberfirst-fit coloring algorithm

Mathematics Subject Classification ID

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

Cites Work

• On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
• Cycles of even length in graphs
• Results on the Grundy chromatic number of graphs
• On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
• Asymptotic lower bounds for Ramsey functions
• Coloring inductive graphs on-line
• On-line and first fit colorings of 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
• Title not available (Why is that?)
• Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
• Title not available (Why is that?)
• Title not available (Why is that?)
• A lower bound for approximating the Grundy number

Cited In (7)

• First-fit coloring of bounded tolerance graphs
• Inequalities for the first-fit chromatic number
• Bounds for the Grundy chromatic number of graphs in terms of domination number
• First-fit chromatic numbers of \(d\)-degenerate graphs
• \((\delta, \chi_{\mathsf{FF}})\)-bounded families of graphs
• Upper bounds for some graph invariants in terms of blocks and cut-vertices
• More bounds for the Grundy number of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326475)