Pages that link to "Item:Q456892"

The following pages link to Gap vertex-distinguishing edge colorings of graphs (Q456892):

Displaying 8 items.

• On strongly planar not-all-equal 3SAT (Q326466) (← links)
• Algorithmic complexity of proper labeling problems (Q391137) (← links)
• A note on edge weightings inducing proper vertex colorings (Q1756095) (← links)
• On the complexity of gap-\([2]\)-vertex-labellings of subcubic bipartite graphs (Q2132413) (← links)
• A Vizing-like theorem for union vertex-distinguishing edge coloring (Q2410224) (← links)
• New estimates for the gap chromatic number (Q2449176) (← links)
• On gap-labellings of some families of graphs (Q6048440) (← links)
• Graphs without gap-vertex-labellings: families and bounds (Q6064864) (← links)