Nordhaus–Gaddum problem in terms of G-free coloring

DOI10.1142/S1793830922501142zbMATH Open1516.05070arXiv2201.04330OpenAlexW4281784752MaRDI QIDQ6132869FDOQ6132869

Yaser Rowshan

Publication date: 15 July 2023

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

Abstract: Let $H=(V(H),E(H))$ be a graph. A $k$-coloring of $H$ is a mapping $pi:V(H)longrightarrow1,2,ldots,k$, if each color class induces a $K_2$-free subgraph. For a graph $G$ of order at least $2$, a $G$-free $k$-coloring of $H$, is a mapping $pi:V(H)longrightarrow1,2,ldots,k$, so that the induced subgraph by each color class of $pi$, contains no copy of $G$. The $G$-free chromatic number of $H$, is the minimum number $k$, so that it has a $G$-free $k$-coloring, and denoted by $ch{i}_G(H)$. In this paper, we give some bounds and attributes on the $G$-free chromatic number of graphs, in terms of the number of vertices, maximum degree, minimum degree, and chromatic number. Our main results are the Nordhaus-Gaddum-type theorem for the $G$-free chromatic number of a graph.

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

Recommendations

• The Nordhaus-Gaddum problem for the \(k\)-defective chromatic number of a \(P_4\)-free graph
• scientific article; zbMATH DE number 500499
• Chromatic sums for colorings avoiding monochromatic subgraphs
• On the chromatic number of \(2 K_2\)-free graphs
• Extremal graphs in some coloring problems

zbMATH Keywords

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey of Nordhaus-Gaddum type relations
• On Complementary Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
• On the Point-Arboricity of a Graph and its Complement
• A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs

Cited In (4)

• Title not available (Why is that?)
• Essentially disjoint families, conflict free colorings and Shelah's revised GCH
• The complexity of \(G\)-free colourability
• Some bounds on the size of maximum G-free sets in graphs

This page was built for publication: Nordhaus–Gaddum problem in terms of G-free coloring

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