The following pages link to A survey on packing colorings (Q2194523):
Displaying 22 items.
- Complexity of the packing coloring problem for trees (Q972338) (← links)
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (Q1015318) (← links)
- Packing coloring of Sierpiński-type graphs (Q1621491) (← links)
- \((d, n)\)-packing colorings of infinite lattices (Q1701099) (← 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)
- Graph classes generated by Mycielskians (Q2194538) (← links)
- \(S\)-packing chromatic vertex-critical graphs (Q2197411) (← links)
- Dichotomies properties on computational complexity of \(S\)-packing coloring problems (Q2407038) (← links)
- The packing coloring problem for lobsters and partner limited graphs (Q2448872) (← 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)
- Polynomial instances of the packing coloring problem (Q2840736) (← links)
- The \(S\)-packing chromatic number of a graph (Q2866422) (← links)
- The exponential growth of the packing chromatic number of iterated Mycielskians (Q6069170) (← links)
- A characterization of 4-\(\chi_S\)-vertex-critical graphs for packing sequences with \(s_1 = 1\) and \(s_2 \geq 3\) (Q6166040) (← links)
- The packing chromatic number of the infinite square grid is 15 (Q6535369) (← links)
- On uniquely packable trees (Q6608730) (← links)
- Packing coloring of hypercubes with extended Hamming codes (Q6633542) (← links)
- Partial packing coloring and quasi-packing coloring of the triangular grid (Q6646429) (← links)
- Independence, matching and packing coloring of the iterated Mycielskian of graphs (Q6657219) (← links)
