%0 Journal Article
%T Simultaneous coloring of vertices and incidences of hypercubes
%J Communications in Combinatorics and Optimization
%I Azarbaijan Shahid Madani University
%Z 2538-2128
%A Mozafari-Nia, Mahsa
%A N. Iradmusa, Moharram
%D 2024
%\ 03/01/2024
%V 9
%N 1
%P 67-77
%! Simultaneous coloring of vertices and incidences of hypercubes
%K Incidence of graph
%K simultaneous coloring of graph
%K hypercube
%R 10.22049/cco.2023.27843.1367
%X An element $i=(v,e)$ of a graph $G$ is called an incidence of $G$, if $v\in V(G)$, $e\in E(G)$ and $v\in e$. The simultaneous coloring of vertices and incidences of a graph is coloring the vertices and incidences of the graph properly at the same time such that any two adjacent or incident elements receive distinct colors. In this paper, we investigate the simultaneous coloring of vertices and incidences of hypercubes.
%U https://comb-opt.azaruniv.ac.ir/article_14618_faa7a557f561944ebf780cd7170ff722.pdf