Pages that link to "Item:Q2407038"

The following pages link to Dichotomies properties on computational complexity of \(S\)-packing coloring problems (Q2407038):

Displaying 17 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)
• Spectrum graph coloring and applications to Wi-Fi channel assignment (Q1657008) (← links)
• Packing chromatic number of cubic graphs (Q1686001) (← 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)
• 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)
• Packing coloring of some undirected and oriented coronae graphs (Q2364089) (← links)
• Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction (Q2420428) (← links)
• Packing chromatic number of base-3 Sierpiński graphs (Q2631074) (← 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)