Simultaneous coloring of vertices and incidences of graphs

arXiv2205.07189MaRDI QIDQ6399185FDOQ6399185

Authors: Mahsa Mozafari-Nia, M. N. Iradmusa 

Publication date: 15 May 2022

Abstract: An $n$-subdivision of a graph $G$ is a graph constructed by replacing a path of length $n$ instead of each edge of $G$ and an $m$-power of $G$ is a graph with the same vertices as $G$ and any two vertices of $G$ at distance at most $m$ are adjacent. The graph $G^{fracmn}$ is the $m$-power of the $n$-subdivision of $G$. In [M. N. Iradmusa, M. Mozafari-Nia, A note on coloring of $frac33$-power of subquartic graphs, Vol. 79, No.3, 2021] it was conjectured that the chromatic number of $frac33$-power of graphs with maximum degree $Deltageq2$ is at most $2Delta+1$. In this paper, we introduce the simultaneous coloring of vertices and incidences of graphs and show that the minimum number of colors for simultaneous proper coloring of vertices and incidences of $G$, denoted by $ch{i}_{vi}(G)$, is equal to the chromatic number of $G^{frac33}$. Also by determining the exact value or the upper bound for the said parameter, we investigate the correctness of the conjecture for some classes of graphs such as $k$-degenerated graphs, cycles, forests, complete graphs, and regular bipartite graphs. In addition, we investigate the relationship between this new chromatic number and the other parameters of graphs.

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Simultaneous coloring of vertices and incidences of graphs

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