\(b\)-continuity and partial Grundy coloring of graphs with large girth

DOI10.1016/j.disc.2020.111920zbMath1441.05077arXiv1908.00674OpenAlexW3014707921MaRDI QIDQ2185922

Yanyan Li

Publication date: 8 June 2020

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

Full work available at URL: https://arxiv.org/abs/1908.00674

zbMATH Keywords

bipartite graphs\(b\)-continuitygraphs with large girth\(b\)-coloringspartial Grundy colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(b\)-coloring of Kneser graphs
• On \(b\)-colorings in regular graphs
• Some perfect coloring properties of graphs
• Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
• The b-chromatic number of a graph
• On the equality of the partial Grundy and upper ochromatic numbers of graphs
• The \(b\)-continuity of graphs with large girth
• \(b\)-coloring of tight graphs
• Interpolation theorem for partial Grundy coloring
• \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
• On the \(b\)-chromatic number of regular graphs
• Graphs of girth at least 7 have high \(b\)-chromatic number
• On the \(b\)-continuity property of graphs
• An algorithm for partial Grundy number on trees
• The NP-Completeness of Edge-Coloring
• Reducibility among Combinatorial Problems

This page was built for publication: \(b\)-continuity and partial Grundy coloring of graphs with large girth