Note on a new coloring number of a graph

1980 ◽  
Vol 4 (1) ◽  
pp. 111-113 ◽  
Author(s):  
P. Horák ◽  
J. Širáň
Keyword(s):  
2010 ◽  
Vol 310 (10-11) ◽  
pp. 1520-1523 ◽  
Author(s):  
Mickael Montassier ◽  
Arnaud Pêcher ◽  
André Raspaud ◽  
Douglas B. West ◽  
Xuding Zhu

Order ◽  
2003 ◽  
Vol 20 (3) ◽  
pp. 255-264 ◽  
Author(s):  
H. A. Kierstead ◽  
Daqing Yang

2007 ◽  
Vol 16 (07) ◽  
pp. 959-967 ◽  
Author(s):  
S. SATOH

Fox's shadow p-colorings of a knot K define two kinds of Laurent polynomials, Φp(K) and [Formula: see text], as invariants of K. We prove that the equality [Formula: see text] holds for any knot K. Also we prove that, if the p-coloring number of K is equal to p2, then [Formula: see text] has the form [Formula: see text] for some N ∈ ℤp.


1995 ◽  
Vol 141 (1-3) ◽  
pp. 279-283 ◽  
Author(s):  
Anita C. Burris
Keyword(s):  

2019 ◽  
Vol 28 (07) ◽  
pp. 1950047 ◽  
Author(s):  
Eri Matsudo

The minimal coloring number of a [Formula: see text]-colorable link is defined as the minimum number of colors for nontrivial [Formula: see text]-colorings on diagrams of the link. In this paper, we show that the minimal coloring number of any nonsplittable [Formula: see text]-colorable links is four.


2019 ◽  
Vol 796 ◽  
pp. 187-195
Author(s):  
Robert Janczewski ◽  
Paweł Obszarski ◽  
Krzysztof Turowski
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document