Pages that link to "Item:Q3440265"

The following pages link to Full Color Theorems for L(2,1)-Colorings (Q3440265):

Displaying 15 items.

• Radio graceful Hamming graphs (Q339492) (← links)
• A note on \(L (2, 1)\)-labelling of trees (Q511194) (← links)
• On island sequences of labelings with a condition at distance two (Q968105) (← links)
• No-hole \(L(2,1)\)-colorings (Q1408461) (← links)
• A note on collections of graphs with non-surjective lambda labelings (Q1765378) (← links)
• A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number (Q2012891) (← links)
• \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs (Q2181256) (← links)
• Extremal problems on consecutive \(L(2,1)\)-labelling (Q2370429) (← links)
• An extremal problem on non-full colorable graphs (Q2384400) (← links)
• Path covering number and \(L(2,1)\)-labeling number of graphs (Q2446849) (← links)
• On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs (Q2457022) (← links)
• On the universality and extremality of graphs with a distance constrained colouring (Q2674369) (← links)
• Hole: An Emerging Character in the Story of Radio k-Coloring Problem (Q4555205) (← links)
• On irreducible no‐hole <i>L</i>(2, 1)‐coloring of trees (Q5191141) (← links)
• On the<i>L</i>(2, 1)-labelling of block graphs (Q5391500) (← links)