Pages that link to "Item:Q972338"

The following pages link to Complexity of the packing coloring problem for trees (Q972338):

Displaying 43 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)
• 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)
• 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)
• On the packing chromatic number of subcubic outerplanar graphs (Q1727741) (← links)
• Facial packing vertex-coloring of subdivided plane graphs (Q1730225) (← 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)
• Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs (Q2043348) (← links)
• On \(S\)-packing edge-colorings of graphs with small edge weight (Q2073113) (← 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)
• \(S\)-packing chromatic vertex-critical graphs (Q2197411) (← links)
• Packing colorings of subcubic outerplanar graphs (Q2198310) (← links)
• The packing chromatic number of hypercubes (Q2352790) (← 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)
• 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)
• A note on the packing chromatic number of lexicographic products (Q2659160) (← links)
• Polynomial instances of the Packing Coloring Problem (Q2840736) (← links)
• On packing coloring of helm related graphs (Q5036739) (← links)
• (Q5071858) (← links)
• Packing chromatic numbers of finite super subdivisions of graphs (Q5081175) (← links)
• The exponential growth of the packing chromatic number of iterated Mycielskians (Q6069170) (← links)
• On packing \(S\)-colorings of subcubic graphs (Q6157413) (← links)