Pages that link to "Item:Q4443137"

The following pages link to Labeling Planar Graphs with Conditions on Girth and Distance Two (Q4443137):

Displaying 14 items.

• 2-Distance Coloring of Sparse Graphs (Q2930038) (← links)
• (Q3576657) (← links)
• A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5 (Q4577850) (← links)
• List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles (Q4978441) (← links)
• 2-Distance coloring of planar graph (Q5012803) (← links)
• Adjacency Labelling for Planar Graphs (and Beyond) (Q5056430) (← links)
• 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles (Q5232154) (← links)
• 2-Distance chromatic number of some graph products (Q5854751) (← links)
• Injective coloring of planar graphs (Q5902135) (← links)
• A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable (Q5963659) (← links)
• Coloring the square of maximal Planar graphs with diameter two (Q6048644) (← links)
• 2-distance coloring of planar graphs without adjacent 5-cycles (Q6166190) (← links)
• Incidence coloring of outer-1-planar graphs (Q6565538) (← links)
• The 2-distance chromatic number of planar graphs without 3,4,8-cycles (Q6645214) (← links)