Pages that link to "Item:Q2461777"

The following pages link to Labeling planar graphs with a condition at distance two (Q2461777):

Displaying 9 items.

• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
• Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
• Graph labellings with variable weights, a survey (Q967309) (← links)
• Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
• Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
• The List \(L(2, 1)\)-labeling of planar graphs (Q1637136) (← links)
• The list \(L(2,1)\)-labeling of planar graphs with large girth (Q2039710) (← links)
• Optimal frequency assignment and planar list \(L(2, 1)\)-labeling (Q2084641) (← links)