Pages that link to "Item:Q947103"

The following pages link to Labelling planar graphs without 4-cycles with a condition on distance two (Q947103):

Displaying 7 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)
• 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)
• Bounding the chromatic number of squares of \(K_4\)-minor-free graphs (Q2421854) (← links)
• On \(L (p, q)\)-labelling of planar graphs without cycles of length four (Q2698183) (← links)
• Coloring the square of maximal Planar graphs with diameter two (Q6048644) (← links)