The following pages link to (Q3070232):
Displaying 18 items.
- 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)
- On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs (Q3503530) (← links)
- Packing colouring of some classes of cubic graphs (Q4622625) (← links)
- On packing coloring of helm related graphs (Q5036739) (← links)
- Between Proper and Strong Edge-Colorings of Subcubic Graphs (Q5041205) (← links)
- (Q5071858) (← links)
- Packing chromatic numbers of finite super subdivisions of graphs (Q5081175) (← links)
- Complexity of the Packing Coloring Problem for Trees (Q5302050) (← links)
- (Q5874562) (← links)
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees (Q5900073) (← links)
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees (Q5920353) (← links)
- The optimal bound on the 3-independence number obtainable from a polynomial-type method (Q6041879) (← links)
- Between proper and strong edge‐colorings of subcubic graphs (Q6046648) (← 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)
- About \(S\)-packing coloring of subcubic graphs (Q6204334) (← links)