Pages that link to "Item:Q288235"

The following pages link to A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235):

Displaying 2 items.

• 2-distance vertex-distinguishing index of subcubic graphs (Q724740) (← links)
• On \(t\)-relaxed 2-distant circular coloring of graphs (Q2045235) (← links)