نتایج جستجو برای: locating chromatic number of graphs

تعداد نتایج: 21192455  

Journal: :Journal of Combinatorial Theory, Series B 1992

Journal: :Journal of Combinatorial Theory, Series A 1990

Journal: :SIAM Journal on Discrete Mathematics 2013

Journal: :SIAM J. Discrete Math. 2009
Hal A. Kierstead Bojan Mohar Simon Spacapan Daqing Yang Xuding Zhu

The two-coloring number of graphs, which was originally introduced in the study of the game chromatic number, also gives an upper bound on the degenerate chromatic number as introduced by Borodin. It is proved that the two-coloring number of any planar graph is at most nine. As a consequence, the degenerate list chromatic number of any planar graph is at most nine. It is also shown that the deg...

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling   with $d$ labels  that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید