Pages that link to "Item:Q2857337"

The following pages link to 2-distance coloring of sparse graphs (Q2857337):

Displaying 13 items.

• On incidence coloring conjecture in Cartesian products of graphs (Q313802) (← links)
• On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
• The list 2-distance coloring of sparse graphs (Q776639) (← links)
• Vertex colorings with a distance restriction (Q1584412) (← links)
• A Brooks-type result for sparse critical graphs (Q1786052) (← links)
• 2-distance list \((\varDelta +3)\)-coloring of sparse graphs (Q2084788) (← links)
• Two-distance vertex-distinguishing index of sparse subcubic graphs (Q2186287) (← links)
• The \(k\)-distance chromatic number of trees and cycles (Q2293844) (← links)
• Distance-two coloring of sparse graphs (Q2441647) (← links)
• 2-Distance Coloring of Sparse Graphs (Q2930038) (← links)
• (Q2991086) (← links)
• (Q4865135) (← links)
• Distance-2 Coloring in the CONGEST Model (Q5855241) (← links)