Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Małafiejski, Michał"'
Publikováno v:
In Discrete Applied Mathematics 31 May 2019 261:305-315
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 1, Pp 107-119 (2018)
In the paper, we show that the incidence chromatic number χi of a complete k-partite graph is at most Δ + 2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to Δ + 1 if and only if the smallest part has only one v
Externí odkaz:
https://doaj.org/article/fb8745469ac243cb886d2827909c0d1b
Autor:
Małafiejska Anna, Małafiejski Michał
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 2, Pp 427-441 (2017)
In this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is NP-complete, and
Externí odkaz:
https://doaj.org/article/7bfcde5e45404770b035f0be55dae315
Publikováno v:
In Discrete Applied Mathematics 19 February 2015 182:73-83
Publikováno v:
In Discrete Applied Mathematics 31 March 2014 166:131-140
The complexity of the [formula omitted]-labeling problem for bipartite planar graphs of small degree
Publikováno v:
In Discrete Mathematics 2009 309(10):3270-3279
Publikováno v:
In Computational Geometry: Theory and Applications 2007 37(2):59-71
Autor:
Kuszner, Łukasz, Małafiejski, Michał
Publikováno v:
In European Journal of Operational Research 2007 176(1):145-150
Publikováno v:
In Discrete Mathematics 2001 236(1):131-143
Publikováno v:
Graphs & Combinatorics. Nov2008, Vol. 24 Issue 5, p461-468. 8p. 4 Diagrams.