Pages that link to "Item:Q3553236"

The following pages link to Multi-coloring the Mycielskian of graphs (Q3553236):

Displaying 8 items.

• Packing chromatic number versus chromatic and clique number (Q1647755) (← links)
• Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs (Q1752619) (← links)
• Multiple \(L(j,1)\)-labeling of the triangular lattice (Q2015807) (← links)
• On the multiple Borsuk numbers of sets (Q2017114) (← links)
• Independence number and packing coloring of generalized Mycielski graphs (Q2656330) (← links)
• On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
• On the Multichromatic Number of s‐Stable Kneser Graphs (Q5265332) (← links)
• The exponential growth of the packing chromatic number of iterated Mycielskians (Q6069170) (← links)