Spectral upper bounds for the Grundy number of a graph

DOI10.1016/j.disc.2024.114326MaRDI QIDQ6658056

Thiago Assis, Gabriel Coutinho, Emanuel Juliano

Publication date: 8 January 2025

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

matching polynomialinterlacingGrundy number

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs
• First-fit chromatic numbers of \(d\)-degenerate graphs
• Results on the Grundy chromatic number of graphs
• The hierarchical product of graphs
• Coloring inductive graphs on-line
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• On the Grundy Number of a Graph
• On the First-Fit Chromatic Number of Graphs
• On the theory of the matching polynomial
• Cliques in random graphs
• The Largest Eigenvalue of Sparse Random Graphs
• The Eigenvalues of a Graph and Its Chromatic Number

This page was built for publication: Spectral upper bounds for the Grundy number of a graph