Pages that link to "Item:Q2827784"
From MaRDI portal
The following pages link to Equitable coloring of corona products of cubic graphs is harder than ordinary coloring (Q2827784):
Displaying 8 items.
- Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines (Q1686064) (← links)
- Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (Q1701101) (← links)
- Equitable total coloring of corona of cubic graphs (Q2042627) (← links)
- On the \(r\)-dynamic coloring of subdivision-edge coronas of a path (Q2129829) (← links)
- Equitable colorings of corona multiproducts of graphs (Q2409797) (← links)
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (Q4971668) (← links)
- Energy and basic reproduction number of n-Corona graphs prior to order 1 (Q5866630) (← links)
- Equitable colorings of \(l\)-corona products of cubic graphs (Q6577196) (← links)
