Nordhaus–Gaddum problem in terms of G-free coloring

DOI10.1142/s1793830922501142zbMath1516.05070arXiv2201.04330OpenAlexW4281784752MaRDI QIDQ6132869

Yaser Rowshan

Publication date: 15 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

conditional chromatic number\(G\)-free coloring\(G\)-free criticalthe Nordhaus-Gaddum problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Some bounds on the size of maximum G-free sets in graphs

Cites Work

• Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
• A survey of Nordhaus-Gaddum type relations
• A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs
• On Complementary Graphs
• On the Point-Arboricity of a Graph and its Complement
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item