Cite
Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
MLA
Cambie, Stijn, and Rimma Hämäläinen. Packing Colourings in Complete Bipartite Graphs and the Inverse Problem for Correspondence Packing. 2023. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.2303.01944&authtype=sso&custid=ns315887.
APA
Cambie, S., & Hämäläinen, R. (2023). Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing.
Chicago
Cambie, Stijn, and Rimma Hämäläinen. 2023. “Packing Colourings in Complete Bipartite Graphs and the Inverse Problem for Correspondence Packing.” http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.2303.01944&authtype=sso&custid=ns315887.