Add to ORKGDP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořák and Postle. We introduce and study (i, j)-defective DP-colorings of simple graphs. Let gDP(i, j, n)be the minimum number of edges in an n-vertex DP-(i, j)-critical graph. In this paper we determine sharp bound on gDP(i, j, n)for each i ≥3and j ≥2i +1for infinitely many n
A graph G is (m, k)-colourable if its vertices can be coloured with m colours such that the maximum ...
AbstractWe investigate a restricted list-coloring problem. Given a graph G = (V, E), a non empty set...
A graph is (k; d)-colorable if one can color the vertices with k colors such that no vertex is adjac...
In Defective Coloring we are given a graph $G$ and two integers $\chi_d$,$\Delta^*$ and are asked if...
This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in e...
DP-coloring (also called correspondence coloring) is a generalization of list coloring that has been...
AbstractA graph is (m,k)-colorable if its vertices can be colored with m colors in such a way that e...
A graph G is (m,k)-colourable if its vertices can be coloured with m colours such that the maximum d...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...
DP-coloring (or correspondence coloring) is a generalization of list coloring that has been widely s...
A graph is (k; d)-colorable if one can color the vertices with k colors such that no vertex is adjac...
DP-coloring (also called correspondence coloring) is a generalization of list coloring introduced by...
AbstractA graph G is (m,k)-colourable if its vertices can be coloured with m colours such that the m...
We consider questions regarding the existence of graphs and hypergraphs with certain coloring proper...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...
A graph G is (m, k)-colourable if its vertices can be coloured with m colours such that the maximum ...
AbstractWe investigate a restricted list-coloring problem. Given a graph G = (V, E), a non empty set...
A graph is (k; d)-colorable if one can color the vertices with k colors such that no vertex is adjac...
In Defective Coloring we are given a graph $G$ and two integers $\chi_d$,$\Delta^*$ and are asked if...
This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in e...
DP-coloring (also called correspondence coloring) is a generalization of list coloring that has been...
AbstractA graph is (m,k)-colorable if its vertices can be colored with m colors in such a way that e...
A graph G is (m,k)-colourable if its vertices can be coloured with m colours such that the maximum d...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...
DP-coloring (or correspondence coloring) is a generalization of list coloring that has been widely s...
A graph is (k; d)-colorable if one can color the vertices with k colors such that no vertex is adjac...
DP-coloring (also called correspondence coloring) is a generalization of list coloring introduced by...
AbstractA graph G is (m,k)-colourable if its vertices can be coloured with m colours such that the m...
We consider questions regarding the existence of graphs and hypergraphs with certain coloring proper...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...
A graph G is (m, k)-colourable if its vertices can be coloured with m colours such that the maximum ...
AbstractWe investigate a restricted list-coloring problem. Given a graph G = (V, E), a non empty set...
A graph is (k; d)-colorable if one can color the vertices with k colors such that no vertex is adjac...