Pages that link to "Item:Q2866422"

The following pages link to The S-packing chromatic number of a graph (Q2866422):

Displaying 26 items.

• \(S\)-packing colorings of cubic graphs (Q294536) (← links)
• Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph (Q509625) (← links)
• Packing coloring of Sierpiński-type graphs (Q1621491) (← links)
• Packing chromatic number versus chromatic and clique number (Q1647755) (← links)
• \((d, n)\)-packing colorings of infinite lattices (Q1701099) (← links)
• A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices (Q1730261) (← links)
• On \(S\)-packing edge-colorings of cubic graphs (Q1735677) (← links)
• Packing chromatic number of subdivisions of cubic graphs (Q1741592) (← links)
• \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) (Q2028095) (← links)
• Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs (Q2043348) (← links)
• On \(S\)-packing edge-colorings of graphs with small edge weight (Q2073113) (← links)
• Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs (Q2192116) (← links)
• A survey on packing colorings (Q2194523) (← links)
• \(S\)-packing chromatic vertex-critical graphs (Q2197411) (← links)
• The packing chromatic number of hypercubes (Q2352790) (← links)
• Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph (Q2401415) (← links)
• Dichotomies properties on computational complexity of \(S\)-packing coloring problems (Q2407038) (← links)
• Packing chromatic number of base-3 Sierpiński graphs (Q2631074) (← links)
• A note on \(S\)-packing colorings of lattices (Q2636817) (← links)
• On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs (Q2662888) (← links)
• On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) (Q2698203) (← links)
• A GENERAL POSITION PROBLEM IN GRAPH THEORY (Q4684254) (← links)
• Between Proper and Strong Edge-Colorings of Subcubic Graphs (Q5041205) (← links)
• Between proper and strong edge‐colorings of subcubic graphs (Q6046648) (← links)
• On packing \(S\)-colorings of subcubic graphs (Q6157413) (← links)
• A characterization of 4-\(\chi_S\)-vertex-critical graphs for packing sequences with \(s_1 = 1\) and \(s_2 \geq 3\) (Q6166040) (← links)