Pages that link to "Item:Q1025950"

The following pages link to The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950):

Displaying 8 items.

• An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767) (← links)
• Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
• Locally injective \(k\)-colourings of planar graphs (Q400498) (← links)
• The complexity of \(L(p, q)\)-edge-labelling (Q2154095) (← links)
• Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
• Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
• On the Complexity of Planar Covering of Small Graphs (Q3104767) (← links)
• The complexity of \(L(p, q)\)-edge-labelling (Q6090539) (← links)