Pages that link to "Item:Q1641149"

The following pages link to Notes on complexity of packing coloring (Q1641149):

Displaying 10 items.

• Complexity of the packing coloring problem for trees (Q972338) (← links)
• \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited (Q2067672) (← links)
• Graphs that are critical for the packing chromatic number (Q2118245) (← links)
• A survey on packing colorings (Q2194523) (← links)
• On the packing chromatic number of Moore graphs (Q2217471) (← links)
• Parameterized Complexity of Geodetic Set (Q5050005) (← links)
• Packing chromatic numbers of finite super subdivisions of graphs (Q5081175) (← links)
• (Q5089227) (← links)
• Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
• Parameterized Complexity of Geodetic Set (Q6089667) (← links)