mtmt
The Hungarian Scientific Bibliography
XML
JSON
Public search
Magyarul
Proceedings of the 13th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB'25
English Scientific
Published:
2025
Conference:
European Conference on Combinatorics, Graph Theory and Applications, Eurocomb'25 2025-08-25 [Bp, Hungary]
Identifiers
MTMT: 36432641
Other URL:
https://site.pheedloop.com/event/Eurocomb25/Abstracts
Other URL:
https://site.pheedloop.com/event/Eurocomb25/home
Chapters
Candela P. et al. Higher-order Fourier analysis via spectral algorithms. (2025) In: Proceedings of the 13th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB'25 p. &
Pálfy Péter Pál. On the isomorphism problem of Cayley digraphs. (2025) In: Proceedings of the 13th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB'25 p. &
Nóra Almási et al. Alternating odd cycles in orientations of topologically χ-chromatic graphs. (2025) In: Proceedings of the 13th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB'25 pp. 37-41
Simona Boyadzhiyska et al. Almost-perfect colorful matchings in bipartite graphs. (2025) In: Proceedings of the 13th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB'25 pp. 180-185
Csonka Bence. Fractional Haemers' bound and the Mycielski construction. (2025) In: Proceedings of the 13th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB'25 pp. 332-335
P.L. Erdős et al. Every fully graphic degree sequence region is P -stable. (2025) In: Proceedings of the 13th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB'25 pp. 795-800
Fekete Panna Tímea et al. Complexity of finding maximal color-avoiding connected subgraphs. (2025) In: Proceedings of the 13th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB'25 pp. 962-969
Citation styles:
IEEE
ACM
APA
Chicago
Harvard
CSL
Copy
Print
2026-05-13 09:27
×
Export list as bibliography
Citation styles:
IEEE
ACM
APA
Chicago
Harvard
Print
Copy