Pages that link to "Item:Q1808715"

The following pages link to \(T\)-colorings and \(T\)-edge spans of graphs (Q1808715):

Displaying 8 items.

• An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767) (← links)
• No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups (Q879397) (← links)
• Colorings at minimum cost (Q960968) (← links)
• The edge span of T-coloring on graph \(C^{d}_{n}\) (Q2371031) (← links)
• \(T\)-coloring of certain networks (Q2630781) (← links)
• (Q2752161) (← links)
• Minimum Span of No-Hole (<i>r</i>+1)-Distant Colorings (Q2753531) (← links)
• Between Colorings and Layouts - Minimum Morphism Cost Problems (Q3439587) (← links)