Pages that link to "Item:Q413250"

The following pages link to Computation of lucky number of planar graphs is NP-hard (Q413250):

Displaying 9 items.

• On strongly planar not-all-equal 3SAT (Q326466) (← links)
• Algorithmic complexity of proper labeling problems (Q391137) (← links)
• Topological additive numbering of directed acyclic graphs (Q477623) (← links)
• Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
• Additive list coloring of planar graphs with given girth (Q2175242) (← links)
• A lower bound and several exact results on the \(d\)-lucky number (Q2284776) (← links)
• On the additive chromatic number of several families of graphs (Q2308457) (← links)
• On the semi-proper orientations of graphs (Q2663989) (← links)
• (Q5076575) (← links)