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 6 items.

• 2-distance vertex-distinguishing index of subcubic graphs (Q724740) (← links)
• On \(t\)-relaxed 2-distant circular coloring of graphs (Q2045235) (← links)
• Two-distance vertex-distinguishing index of sparse subcubic graphs (Q2186287) (← links)
• Optimal \(r\)-dynamic coloring of sparse graphs (Q2424825) (← links)
• 2-distance vertex-distinguishing total coloring of graphs (Q4634521) (← links)
• (Q6188237) (← links)