Pages that link to "Item:Q4443137"

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

Displaying 50 items.

• An improved bound on 2-distance coloring plane graphs with girth 5 (Q306114) (← links)
• Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors (Q317434) (← links)
• 2-distance coloring of a planar graph without 3, 4, 7-cycles (Q328716) (← links)
• Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable (Q393358) (← links)
• \(L(p,q)\)-labeling of a graph embeddable on the torus (Q400502) (← links)
• On backbone coloring of graphs (Q434190) (← links)
• On 2-distance coloring of plane graphs with girth 5 (Q516880) (← links)
• List coloring the square of sparse graphs with large degree (Q740267) (← links)
• The \(L(p, q)\)-labelling of planar graphs without 4-cycles (Q741764) (← links)
• \(L(p, q)\)-labeling of planar graphs with small girth (Q777443) (← links)
• \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs (Q844189) (← links)
• The 2-dipath chromatic number of Halin graphs (Q845671) (← links)
• The \(L(2,1)\)-labeling on planar graphs (Q868019) (← links)
• Distance-two labelings of digraphs (Q881579) (← links)
• List 2-distance coloring of planar graphs (Q887861) (← links)
• Coloring the square of graphs whose maximum average degree is less than 4 (Q906469) (← links)
• Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
• Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
• (2,1)-total labelling of trees with sparse vertices of maximum degree (Q976073) (← links)
• \((2,1)\)-Total number of trees with maximum degree three (Q989489) (← links)
• Some results on distance two labelling of outerplanar graphs (Q1036889) (← links)
• Some results on the incidence coloring number of a graph (Q1043553) (← links)
• Linear coloring of planar graphs with large girth (Q1045057) (← links)
• Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
• Coloring the square of a \(K_{4}\)-minor free graph (Q1402088) (← links)
• Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
• Facial incidence colorings of embedded multigraphs (Q1630925) (← links)
• Planar graphs of girth at least five are square \((\delta + 2)\)-choosable (Q1633752) (← links)
• 2-distance coloring of planar graphs with girth 5 (Q1679523) (← links)
• List \(r\)-hued chromatic number of graphs with bounded maximum average degrees (Q1709519) (← links)
• 2-distance colorings of integer distance graphs (Q1717215) (← links)
• An optimal square coloring of planar graphs (Q1928491) (← links)
• \(L(p,q)\)-labeling of sparse graphs (Q1956243) (← links)
• The list \(L(2,1)\)-labeling of planar graphs with large girth (Q2039710) (← links)
• Optimal frequency assignment and planar list \(L(2, 1)\)-labeling (Q2084641) (← links)
• List 2-distance coloring of planar graphs with girth five (Q2155644) (← links)
• Sharp upper bound of injective coloring of planar graphs with girth at least 5 (Q2165276) (← links)
• Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
• \((2,1)\)-total labeling of trees with large maximum degree (Q2348054) (← links)
• A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) (Q2359803) (← links)
• Coloring squares of planar graphs with girth six (Q2427536) (← links)
• Labeling planar graphs with a condition at distance two (Q2461777) (← links)
• \((2,1)\)-total labelling of outerplanar graphs (Q2462398) (← links)
• Chromatic number of square of maximal outerplanar graphs (Q2466444) (← links)
• The \(L(2,1)\)-labelling of trees (Q2489954) (← links)
• A survey on labeling graphs with a condition at distance two (Q2497501) (← links)
• Degeneracy and colorings of squares of planar graphs without 4-cycles (Q2658379) (← links)
• Coloring squares of planar graphs with maximum degree at most five (Q2689129) (← links)
• On \(L (p, q)\)-labelling of planar graphs without cycles of length four (Q2698183) (← links)
• List 2-distance coloring of planar graphs without short cycles (Q2798330) (← links)