Pages that link to "Item:Q2816507"

The following pages link to The inapproximability for the (0,1)-additive number (Q2816507):

Displaying 2 items.

• Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
• Is there any polynomial upper bound for the universal labeling of graphs? (Q1680487) (← links)