The following pages link to (Q3070232):
Displayed 50 items.
- \(S\)-packing colorings of cubic graphs (Q294536) (← links)
- Facial packing edge-coloring of plane graphs (Q313797) (← links)
- Packing chromatic number of distance graphs (Q412353) (← links)
- Spectral bounds for the \(k\)-independence number of a graph (Q501229) (← links)
- Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph (Q509625) (← links)
- Packing chromatic number under local changes in a graph (Q512610) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- The packing chromatic number of the infinite square lattice is between 13 and 15 (Q528575) (← links)
- Complexity of the packing coloring problem for trees (Q972338) (← links)
- On the packing chromatic number of some lattices (Q987667) (← links)
- The packing chromatic number of infinite product graphs (Q1024309) (← links)
- Packing coloring of Sierpiński-type graphs (Q1621491) (← links)
- An infinite family of subcubic graphs with unbounded packing chromatic number (Q1637153) (← links)
- Notes on complexity of packing coloring (Q1641149) (← links)
- Packing chromatic number versus chromatic and clique number (Q1647755) (← links)
- Packing chromatic number of cubic graphs (Q1686001) (← links)
- \((d, n)\)-packing colorings of infinite lattices (Q1701099) (← links)
- On the packing chromatic number of subcubic outerplanar graphs (Q1727741) (← links)
- Facial packing vertex-coloring of subdivided plane graphs (Q1730225) (← 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)
- A lower bound for the packing chromatic number of the Cartesian product of cycles (Q1955603) (← links)
- Modeling the packing coloring problem of graphs (Q2009921) (← 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)
- \(\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 new approach on locally checkable problems (Q2127611) (← links)
- Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs (Q2192116) (← links)
- A survey on packing colorings (Q2194523) (← links)
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number (Q2197265) (← links)
- \(S\)-packing chromatic vertex-critical graphs (Q2197411) (← links)
- Packing colorings of subcubic outerplanar graphs (Q2198310) (← links)
- On the packing chromatic number of Moore graphs (Q2217471) (← links)
- The \(k\)-independence number of \(t\)-connected graphs (Q2244182) (← links)
- On the \(k\)-independence number of graphs (Q2317661) (← links)
- The packing chromatic number of hypercubes (Q2352790) (← links)
- Packing coloring of some undirected and oriented coronae graphs (Q2364089) (← links)
- Dichotomies properties on computational complexity of \(S\)-packing coloring problems (Q2407038) (← links)
- Packing chromatic number of certain fan and wheel related graphs (Q2409772) (← links)
- Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction (Q2420428) (← links)
- The packing coloring of distance graphs \(D(k,t)\) (Q2440104) (← links)
- On packing colorings of distance graphs (Q2440126) (← links)
- The packing coloring problem for lobsters and partner limited graphs (Q2448872) (← links)
- Packing chromatic number of base-3 Sierpiński graphs (Q2631074) (← links)
- A note on \(S\)-packing colorings of lattices (Q2636817) (← links)
- Independence number and packing coloring of generalized Mycielski graphs (Q2656330) (← links)
- Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree (Q2657095) (← links)
- A note on the packing chromatic number of lexicographic products (Q2659160) (← links)