Pages that link to "Item:Q5191141"

The following pages link to On irreducible no‐hole <i>L</i>(2, 1)‐coloring of trees (Q5191141):

Displaying 11 items.

• Solutions of some \(L(2, 1)\)-coloring related open problems (Q274676) (← links)
• Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph (Q1708400) (← links)
• Infinitely many trees with maximum number of holes zero, one, and two (Q1741707) (← links)
• On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs (Q2012895) (← links)
• \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs (Q2181256) (← links)
• \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs (Q2413382) (← links)
• (Q2752161) (← links)
• Minimum Span of No-Hole (<i>r</i>+1)-Distant Colorings (Q2753531) (← links)
• On Irreducible No-hole L(2, 1)-labelings of Hypercubes and Triangular Lattices (Q2795952) (← links)
• On irreducible no-hole <i>L</i>(2, 1)-coloring of Cartesian product of trees with paths (Q4956226) (← links)
• <i>L</i>(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs (Q5097782) (← links)