Pages that link to "Item:Q1680487"

The following pages link to Is there any polynomial upper bound for the universal labeling of graphs? (Q1680487):

Displaying 5 items.

• On the proper orientation number of chordal graphs (Q820574) (← links)
• On the in-out-proper orientations of graphs (Q2043367) (← links)
• On the proper arc labeling of directed graphs (Q2062885) (← links)
• On the semi-proper orientations of graphs (Q2663989) (← links)
• Proper orientation, proper biorientation and semi-proper orientation numbers of graphs (Q2680602) (← links)