Chromatic number of random graphs: an approach using a recurrence relation

DOI10.1016/J.RINAM.2025.100600MaRDI QIDQ6959619zbMATH OpenFDO

Authors Yayoi Abe, Auna Setoh, Gen Yoneda

Publication date 15 July 2025

Published in Results in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.RINAM.2025.100600

zbMATH Keywords

chromatic numbergraph coloringrandom graphrecurrence relation

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Random graphs (graph-theoretic aspects) (05C80) Probabilistic models, generic numerical methods in probability and statistics (65C20)

Cites work

• A GRASP for coloring sparse graphs
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• Paths in graphs
• Random Graphs
• Random Graphs and Networks: A First Course
• The chromatic number of random graphs
• Using tabu search techniques for graph coloring

This page was built for publication: Chromatic number of random graphs: an approach using a recurrence relation

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