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

DOI10.1007/S10878-015-9900-ZMaRDI QIDQ326475zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 65699 (Why is no real title available?)
• scientific article; zbMATH DE number 2147949 (Why is no real title available?)
• scientific article; zbMATH DE number 2123255 (Why is no real title available?)
• A lower bound for approximating the Grundy number
• Asymptotic lower bounds for Ramsey functions
• Coloring inductive graphs on-line
• Cycles of even length in graphs
• Inequalities for the Grundy chromatic number of graphs
• Inequalities for the first-fit chromatic number
• On the First-Fit Chromatic Number of Graphs
• On the Grundy number of a graph
• On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
• On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
• On-line and first fit colorings of graphs
• Results on the Grundy chromatic number of graphs
• Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth

Cited in

(7)

• First-fit coloring of bounded tolerance graphs
• Inequalities for the first-fit chromatic number
• First-fit chromatic numbers of \(d\)-degenerate graphs
• Bounds for the Grundy chromatic number of graphs in terms of domination number
• \((\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)