Invited lecturesButlerSteveAn introduction to the normalized Laplacian matrix slidesCichaczSylwiaThe zero sum partition of Abelian groups and its applications slidesEllis-MonaghanJoThe Tutte polynomial—a mathematical catalyst slidesKeranenMelissaA Generalization of the Hamilton-Waterloo Problem on Complete Equipartite Graphs slidesSimanjuntakRinoviaBounding the metric dimension of a graph with its local metric dimension and multiset dimension slidesContributed talksAdamsAshleighSimplicial complexes of zero-sumfree setsAlqahtaniMohraA Generalization of Line GraphsArmstrongAmberOn the spectrum problem for the 3-uniform tri-star with 4 edgesBeasleyLeRoyLinear Operators on Graphs: Genus PreserversBoatsJefferyWheel graphs are pansophicalBongNoviOn inclusive and non-inclusive vertex irregular d-distance vertex labelingsBrownDavidEntropy Ranking of TournamentsBuckalewRichardCounting one's (fr)enemiesBungeRyanDecompositions of Complete Multigraphs into Small Tripartite MultigraphsCollinsDontezOn maximum packings of λ-fold complete 3-uniform hypergraphs with loose 3-cyclesDoughertyRyanCovering Arrays and Perfect Hash Families of Higher IndexDowellTuckerCounting vertices in tessallations of the hyperbolic planeDulowskiJordanOn the spectrum problem for the orientations of a 6-cycleEl-ZanatiSaadOn decomposing circulant graphs into forestsEpsteinMichaelOn the Covering Number of U_3(q)FreybergBryanDecomposing complete graphs into unicyclic triangular graphs with eight edgesHallasJamieColor-Induced Graph ColoringsHollidaySarahParameter RepresentativesJacobJobbyL(h, k) labelings and rankings of some dense graphsJettonJoshuaOn the spectrum problem for the 3-uniform loose 5-cycleJohnsGarryOn generalized line graphsKhodkarAbdollahMagic arrays with empty cellsKorenblitMarkComputing of Graph Expression Lengths by means of Simultaneous Recurrences' SolutionLeeJehyunGraph decompositions of 7 vertices and 8 edgesLopezOscarNew Recursive techniques to construct combinatorial designs from smaller simpler designsMishraNutanConstructions of Variance balanced designs using combinatorial techniquesNowakLaurenOn the λ-fold spectrum problem for the connected cubic tripartite multigraphs of order 8OlejniczakDrakeBeyond friendship graphsOrangi-FardNegarExploring the connections between multicommodity maximum flow and modulusOuvrardXavierOn Hb-graphs and their application to hypergraph e-adjacency tensorQiuJiangyiBalanced 3-nearly Platonic GraphsRobertsDanOn the spectra of orientations of K_4 − eSalehiEbrahimOn Friendly Index Sets of Regular Bipartite GraphsSaputroSuhadiOn locating chromatic number of Mycielski graphsSarvateDinesh3-GDDs with block size 4 and 3 groupsSeneviratnePadmapani Binary codes from line graphs of circulant graphsShahmohamadHosseinCancellable numbers, part IIIShanSonglingHamiltonian cycles in tough P_2 \cup P_3-free graphsTrubeyWm. AidenA Variation on 3-GDD with Blocks of Size 4 and 3 GroupsVaidyaSanjuHosoya Polynomials for Graph Vulnerability Measures and Topological IndicesWestremKarleePlaying Farkle with n-sided diceYergerCarlPlanar Graphs with Girth 20 are Additively 3-choosableZhangLi$3-GDD(n_1, n_2, 4;\Lambda_{1},\Lambda_{2})$