Related papers: Block graphs - some general results and their equi…
A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most 1. The equitable chromatic threshold of a graph $G$, denoted by $\chi_=^*(G)$, is the minimum $k$ such that $G$ is equitably…
We study a generalization of the classical Hajnal-Szemer\'edi theorem to vertex-weighted graphs. Given a graph with nonnegative vertex weights, a coloring is called $\alpha$-approximately equitable up to one vertex ($\alpha$-EQ1) if, for…
A conflict-free coloring of a graph $G$ is a (partial) coloring of its vertices such that every vertex $u$ has a neighbor whose assigned color is unique in the neighborhood of $u$. There are two variants of this coloring, one defined using…
Core-periphery structure is an emerging property of a wide range of complex systems and indicate the presence of group of actors in the system with an higher number of connections among them and a lower number of connections with a sparsely…
Let $G$ be a graph on $n$ vertices and let $\mathcal{L}_k$ be an arbitrary function that assigns each vertex in $G$ a list of $k$ colours. Then $G$ is $\mathcal{L}_k$-list colourable if there exists a proper colouring of the vertices of $G$…
A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. In this paper, we first give a useful structural theorem for 1-planar graphs, and then apply it to the list edge and list total…
For a simple graph G = (V, E) and a positive integer k greater than or equal to 2, a coloring of vertices of G using exactly k colors such that every vertex has an equal number of vertices of each color in its closed neighborhood is called…
NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a…
An equitable colouring of a graph $G$ is a colouring of the vertices of $G$ so that no two adjacent vertices are coloured the same and, additionally, the colour class sizes differ by at most $1$. The equitable chromatic number $\chi_=(G)$…
A graph is equitably $k$-colorable if its vertices can be partitioned into $k$ independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest $k$ for which such a coloring exists is known as…
A block graph is a graph in which every block is a complete graph. Let $G$ be a block graph and let $A(G)$ be its (0,1)-adjacency matrix. Graph $G$ is called nonsingular (singular) if $A(G)$ is nonsingular (singular). An interesting open…
For a simple graph G = (V, E), a coloring of vertices of G using two colors, say red and blue, is called a quasi neighborhood balanced coloring if, for every vertex of the graph, the number of red neighbors and the number of blue neighbors…
The chromatic number $\chi(G)$ of a graph $G$, that is, the smallest number of colors required to color the vertices of $G$ so that no two adjacent vertices are assigned the same color, is a classic and extensively studied parameter. Here…
A graph $G$ is equitably $k$-choosable if, for every $k$-uniform list assignment $L$, $G$ is $L$-colorable and each color appears on at most $\left\lceil |V(G)|/k\right\rceil$ vertices. Equitable list-coloring was introduced by Kostochka,…
A weak $c$-colouring of a design is an assignment of colours to its points from a set of $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block-equitable, if for each block, the number of points…
We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this…
We prove that the class of $(K_t,sP_1+P_5)$-free graphs has bounded mim-width for every $s\geq 0$ and $t\geq 1$, and that there is a polynomial-time algorithm that, given a graph in the class, computes a branch decomposition of constant…
The generalized list $T$-coloring is a common generalization of many graph coloring models, including classical coloring, $L(p,q)$-labeling, channel assignment and $T$-coloring. Every vertex from the input graph has a list of permitted…
We study the average number $\mathcal{A}(G)$ of colors in the non-equivalent colorings of a graph $G$. We show some general properties of this graph invariant and determine its value for some classes of graphs. We then conjecture several…
For a simple graph G = (V, E) and a positive integer k greater than or equal to 2, a coloring of vertices of G using exactly k colors such that each vertex has an equal number of neighbors of each color is called neighborhood-balanced…