Abstract
Abstract We generalize the concept of the colorings of mixed hypergraphs to ‘mixed colorings’ of hypergraphs. The idea is to put lower and upper bounds on the number of colors assigned to the vertices in each edge. Some earlier results can be extended for our model, too, while some others — e.g., concerning time complexity — change in a significant way.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
