research
∙
02/24/2020
Vizing-Goldberg type bounds for the equitable chromatic number of block graphs
An equitable coloring of a graph G is a proper vertex coloring of G such...
share
research
∙
09/01/2019
Signified chromatic number of grids is at most 9
A signified graph is a pair (G, Σ) where G is a graph, and Σ is a set of...
research
∙
11/28/2018
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
An n-dimensional hypercube Q_n, is an undirected graph with 2^n nodes, e...
research
∙
02/28/2018
