5th Croatian Combinatorial Days

5th Croatian Combinatorial Days

Zagreb, September 19-20, 2024


CroCoDays

Participants

Schedule

Book of abstracts

Conference photos

Proceedings

Poster

Schedule

Thursday, September 19

09:00-09:20 Registration
09:20-09:30 Opening: Tomislav Došlić
Chair Tomislav Došlić
09:30-09:50 Dragutin Svrtan
Geometry of point particles. Symbolic computer verification of the Atiyah’s Conjecture for five points in the Euclidean plane
09:50-10:10 Simon Brezovnik
Szeged and Mostar root–indices of graphs
10:10-10:30 Niko Tratnik
Resonance Graphs and Daisy Cubes – Part I
10:30-10:50 Petra Žigert Pleteršek
Resonance Graphs and Daisy Cubes – Part II
~ coffee break ~
Chair Vedran Krčadinac
11:30-11:50 Jelena Sedlar
On the Petersen Coloring Conjecture
11:50-12:10 Riste Škrekovski
Selected topics on Wiener index
12:10-12:30 Daniele Parisse
On hyperfibonacci and hyperlucas numbers and their weighted sums
12:30-12:50 Elif Tan
Some notes on generalized Pell graphs
~ lunch ~
Chair Petra Žigert Pleteršek
15:00-15:20 Ivana Zubac
Application of cycles related graphs to dual-ring type of network topology
15:20-15:40 Sara Ban Martinović
Construction of extremal Type II Z8-codes via doubling method
15:40-16:00 Edin Liđan
Perfect matching in graphs obtained from simplicial complex of tilings
16:00-16:20 Tatjana Stanković
Combinatorics and artificial intelligence
~ coffee break ~
Chair Ivica Martinjak
17:00-17:20 Tobias Hofmann
The connectivity dimension of a graph
17:20-17:40 Kurt Klement Gottwald
Dn-Specht Ideals
17:40-18:00 Snježana Majstorović Ergotić
A Comprehensive Overview of the Graovac-Ghorbani Index of a Graph
18:00-18:20 Vedran Krčadinac
Mosaics of projective planes
~ Conference dinner ~

Friday, September 20

Chair Dragutin Svrtan
09:30-09:50 Mathieu Dutour Sikirić
Early termination criterion for polyhedral enumeration
09:50:-10:10 László Németh
Walks on tiled boards
10:10-10:30 Mario Krenn
A Problem of Colored Perfect Matchings Inspired by Quantum Physics
10:30-10:50 Kristijan Tabak
Character type constructions and 3-dimensional Hadamard cubes
~ coffee break ~
Chair Snježana Majstorović Ergotić
11:30-11:50 Marija Maksimović
Characterizing bipartite distanceregularized graphs with vertices of eccentricity at most 4
11:50-12:10 Ivica Martinjak
Generalized Continuant Polynomials
12:10-12:30 Jovan Mikić
A New Theorem from The Number Theory and its Application for a 3-adic Evaluation for Large Schröder Numbers
12:30-12:50 Tomaž Pisanski
Flower graphs
~ lunch ~
Chair Jelena Sedlar
15:00-15:20 Suzana Antunović
Label propagation algorithm for detecting communities in directed acyclic networks
15:20-15:40 Irena M. Jovanovi¢
On equienergetic regular graphs by means of their spectral distances
15:40-16:00 Iva Kodrnja
Projective curves and generalized rascal triangles
16:00-16:20 Helena Koncul
Triangle of numbers arisen from modular forms
~ coffee break ~
Chair László Németh
17:00-17:20 Ana Klobučar Barišić
Minimum-cost double Roman domination problem
17:20-17:40 Mate Puljiz
Combinatorial Settlement Model: Resistance to Predators and Altruists
17:40-18:00 Nino Bašić
Two new constructions for nut graphs – chemical and otherwise
18:00-18:20 Luka Podrug
Resonance graphs of linear phenylenes
~ survivor party ~