Pages that link to "Item:Q2902887"

The following pages link to Labeling planar graphs without 4,5-cycles with a condition on distance two (Q2902887):

Displaying 16 items.

• The \(L(p, q)\)-labelling of planar graphs without 4-cycles (Q741764) (← links)
• \(L(p, q)\)-labeling of planar graphs with small girth (Q777443) (← links)
• Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
• Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
• Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
• List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles (Q1631690) (← links)
• The List \(L(2, 1)\)-labeling of planar graphs (Q1637136) (← links)
• Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate (Q1981692) (← 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)
• On \(L (p, q)\)-labelling of planar graphs without cycles of length four (Q2698183) (← links)
• The \(L(p,q)\)-labeling of planar graphs without cycles of length from 4 to 9 (Q2887382) (← links)
• (Q3110717) (← links)
• (Q3576657) (← links)
• List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles (Q4978441) (← links)
• (Q5398997) (← links)