Zobrazeno 1 - 10
of 135
pro vyhledávání: '"Honkala, Iiro"'
Publikováno v:
Discrete Mathematics 312, 10 (2012) 1832--1837
A proper vertex-colouring of a graph G is said to be locally identifying if for any pair u,v of adjacent vertices with distinct closed neighbourhoods, the sets of colours in the closed neighbourhoods of u and v are different. We show that any graph G
Externí odkaz:
http://arxiv.org/abs/1108.2769
Publikováno v:
In Discrete Applied Mathematics 10 January 2015 180:111-119
Autor:
Honkala, Iiro
Publikováno v:
In European Journal of Combinatorics 2009 30(4):1022-1025
Publikováno v:
The American Mathematical Monthly, 1995 Aug 01. 102(7), 579-588.
Externí odkaz:
https://www.jstor.org/stable/2974552
Autor:
Honkala, Iiro, Laihonen, Tero
Publikováno v:
In Information and Computation 2007 205(7):1078-1095
Autor:
Honkala, Iiro, Laihonen, Tero
Publikováno v:
In European Journal of Combinatorics 2006 27(2):218-227
Autor:
Honkala, Iiro
Publikováno v:
In Journal of Combinatorial Theory, Series A 2006 113(8):1760-1763
Autor:
Honkala, Iiro
Publikováno v:
In Discrete Mathematics 2006 306(21):2670-2681
Autor:
Honkala, Iiro, Laihonen, Tero
Publikováno v:
In Journal of Combinatorial Theory, Series B 2004 91(1):67-86
Publikováno v:
In Discrete Mathematics 2004 276(1):95-109