12 citations · 28 across the 18 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018
A Polynomial Time Algorithm to Find the Star Chromatic Index of Trees
Behnaz Omoomi, Elham Roshanbin, Marzieh Vahid Dastjerdi
A star edge coloring of a graph is a proper edge coloring of such that every path and cycle of length four in uses at least three different colors. The star chromatic i…
math.CO2018★ 3 cited
Star Edge Coloring of the Cartesian Product of Graphs
Behnaz Omoomi, Marzieh Vahid Dastjerdi
A star edge coloring of a graph is a proper edge coloring of such that every path and cycle of length four in uses at least three different colors. The star chromatic i…
math.CO2018
Clique-coloring of -minor free graphs
Behnaz Omoomi, Maryam Taleb
A clique-coloring of a given graph is a coloring of the vertices of such that no maximal clique of size at least two is monocolored. The clique-chromatic number of is t…