Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Furmańczyk, Hanna"'
Autor:
Furmańczyk, Hanna, Mkrtchyan, Vahan
In this paper, we consider some general properties of block graphs as well as the equitable coloring problem in this class of graphs. In the first part we establish the relation between two structural parameters for general block graphs. We also give
Externí odkaz:
http://arxiv.org/abs/2402.05289
Let $G$ be a graph and c a proper k-coloring of G, i.e. any two adjacent vertices u and v have different colors c(u) and c(v). A proper k-coloring is a b-coloring if there exists a vertex in every color class that contains all the colors in its close
Externí odkaz:
http://arxiv.org/abs/2311.13283
Autor:
Furmańczyk, Hanna, Zuazua, Rita
An adjacent vertex distinguishing total $k$-coloring $f$ of a graph $G$ is a proper total $k$-coloring of $G$ such that no pair of adjacent vertices has the same color sets, where the color set at a vertex $v$, $C^G_f(v)$, is $\{f(v)\} \cup \{f(vu)|u
Externí odkaz:
http://arxiv.org/abs/2208.10884
The problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relatio
Externí odkaz:
http://arxiv.org/abs/2207.05868
Publikováno v:
In Applied Mathematics and Computation 15 November 2024 481
Publikováno v:
In Discrete Applied Mathematics 15 September 2024 354:15-28
Publikováno v:
In Computers and Operations Research June 2024 166
Autor:
Pikies, Tytus, Furmańczyk, Hanna
In this paper the problem of scheduling of jobs on parallel machines under incompatibility relation is considered. In this model a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same machine. In
Externí odkaz:
http://arxiv.org/abs/2106.14354
Autor:
Furmańczyk, Hanna, Mkrtchyan, Vahan
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 23 no. 2, special issue in honour of Maurice Pouzet, Special issues (November 30, 2022) dmtcs:6860
An equitable coloring of a graph $G=(V,E)$ is a (proper) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the latter are
Externí odkaz:
http://arxiv.org/abs/2009.12784
An equitable coloring of a graph $G$ is a proper vertex coloring of $G$ such that the sizes of any two color classes differ by at most one. In the paper, we pose a conjecture that offers a gap-one bound for the smallest number of colors needed to equ
Externí odkaz:
http://arxiv.org/abs/2002.10151