2 papers
cs.CC2024
Reducibility among NP-Hard graph problems and boundary classes
Syed Mujtaba Hassan, Shahid Hussain, Abdul Samad
Many NP-hard graph problems become easy for some classes of graphs. For example, coloring is easy for bipartite graphs, but NP-hard in general. So we can ask question like when doe…
cs.DM2024
On coloring graphs with well-distributed edge density
Syed Mujtaba Hassan, Shahid Hussain
In this paper, we introduce a class of graphs which we call average hereditary graphs. Many graphs that occur in the usual graph theory applications belong to this class of graphs.…