Pages that link to "Item:Q2468029"

The following pages link to A survey on the distance-colouring of graphs (Q2468029):

Displaying 45 items.

• \(S\)-packing colorings of cubic graphs (Q294536) (← links)
• Silver block intersection graphs of Steiner 2-designs (Q354426) (← links)
• Distant irregularity strength of graphs (Q394284) (← links)
• \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle (Q498455) (← links)
• The distance coloring of graphs (Q741239) (← links)
• The \(L(p, q)\)-labelling of planar graphs without 4-cycles (Q741764) (← links)
• The square chromatic number of the torus (Q898088) (← links)
• On colorings of graph fractional powers (Q968432) (← links)
• A distance-labelling problem for hypercubes (Q1005224) (← links)
• Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
• Almost injective colorings (Q1630939) (← links)
• List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles (Q1631690) (← links)
• Chromatic numbers of exact distance graphs (Q1633747) (← links)
• Dynamic coloring parameters for graphs with given genus (Q1682887) (← links)
• Distant set distinguishing edge colourings of graphs (Q1686263) (← links)
• Distant total irregularity strength of graphs via random vertex ordering (Q1699557) (← links)
• Distant total sum distinguishing index of graphs (Q1712511) (← links)
• 2-distance colorings of integer distance graphs (Q1717215) (← links)
• \(L(p,q)\)-labeling of sparse graphs (Q1956243) (← links)
• Distant sum distinguishing index of graphs (Q2012525) (← links)
• The complexity of frugal colouring (Q2023759) (← links)
• \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) (Q2028095) (← links)
• Coloring of the \(d^{\text{th}}\) power of the face-centered cubic grid (Q2042611) (← links)
• On \(d_2\)-coloring of certain families of graphs (Q2091583) (← links)
• A characterization of graphs with regular distance-2 graphs (Q2097182) (← links)
• Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
• A survey on packing colorings (Q2194523) (← links)
• Distance-constrained labellings of Cartesian products of graphs (Q2231783) (← links)
• The \(k\)-distance chromatic number of trees and cycles (Q2293844) (← links)
• 2-distance colorings of some direct products of paths and cycles (Q2346336) (← links)
• Distant set distinguishing total colourings of graphs (Q2629496) (← links)
• On the connectivity of k-distance graphs (Q5006605) (← links)
• LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS (Q5100179) (← links)
• Distant sum distinguishing index of graphs with bounded minimum degree (Q5217057) (← links)
• 2-Distance chromatic number of some graph products (Q5854751) (← links)
• Homogeneous colourings of graphs (Q5878484) (← links)
• Template-driven rainbow coloring of proper interval graphs (Q5896886) (← links)
• Template-driven rainbow coloring of proper interval graphs (Q5925620) (← links)
• On conflict-free proper colourings of graphs without small degree vertices (Q6056427) (← links)
• Star chromatic number of some graph products (Q6059104) (← links)
• Average distance colouring of graphs (Q6152843) (← links)
• The packing chromatic number of the infinite square grid is 15 (Q6535369) (← links)
• On the span of \(\ell\) distance coloring of infinite hexagonal grid (Q6629663) (← links)
• Brooks-type theorems for relaxations of square colorings (Q6635100) (← links)
• Proper conflict-free coloring of sparse graphs (Q6657259) (← links)