Pages that link to "Item:Q2816507"
From MaRDI portal
The following pages link to The inapproximability for the (0,1)-additive number (Q2816507):
Displaying 6 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)
- Additive list coloring of planar graphs with given girth (Q2175242) (← links)
- Planar graphs with girth 20 are additively 3-choosable (Q2306581) (← links)
- Automatic tracking and positioning algorithm for moving targets in complex environment (Q2321689) (← links)
- EMD and GNN-adaboost fault diagnosis for urban rail train rolling bearings (Q2321715) (← links)
