Pages that link to "Item:Q3614202"

The following pages link to $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3 (Q3614202):

Displaying 19 items.

• \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (Q436601) (← links)
• \(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028) (← links)
• Linear and cyclic distance-three labellings of trees (Q741540) (← links)
• Graph labellings with variable weights, a survey (Q967309) (← links)
• (2,1)-total labelling of trees with sparse vertices of maximum degree (Q976073) (← links)
• \((2,1)\)-Total number of trees with maximum degree three (Q989489) (← links)
• On \(L(2,1)\)-labeling of generalized Petersen graphs (Q1928525) (← links)
• The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups (Q1956236) (← links)
• Distance-constrained labellings of Cartesian products of graphs (Q2231783) (← links)
• A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\) (Q2279276) (← links)
• \((2,1)\)-total labeling of trees with large maximum degree (Q2348054) (← links)
• A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) (Q2359803) (← links)
• A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\) (Q2411599) (← links)
• \(\mathrm L(2,1)\)-labeling of a circular graph. (Q2828868) (← links)
• Griggs and Yeh's conjecture and \(L(p,1)\)-labelings (Q2902894) (← links)
• (Q3581912) (← links)
• THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE (Q5016312) (← links)
• L(3,1)-labeling of circulant graphs (Q5063266) (← links)
• A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable (Q5963659) (← links)