Crossref
Compression of defining pair for deterministic and strongly deterministic graphs
Algebra and Discrete Mathematics · 2026 · 42 (1) · 93-118
DOI: 10.12958/adm2372 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algebra and Discrete Mathematics, 2026. Verfasst von Oleksii S. Senchenko und 1 weiteren Autor:innen. Die Arbeit nennt 16 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Senchenko, O. S., & Prytula, M. I. (2026). Compression of defining pair for deterministic and strongly deterministic graphs. Algebra and Discrete Mathematics, 42(1), 93-118. https://doi.org/10.12958/adm2372
Vancouver
Senchenko OS, Prytula MI. Compression of defining pair for deterministic and strongly deterministic graphs. Algebra and Discrete Mathematics. 2026;42(1):93-118. doi:10.12958/adm2372
BibTeX
@article{Senchenko2026,
author = {Senchenko, Oleksii S. and Prytula, Mykola I.},
title = {Compression of defining pair for deterministic and strongly deterministic graphs},
journal = {Algebra and Discrete Mathematics},
year = {2026},
volume = {42},
number = {1},
pages = {93--118},
doi = {10.12958/adm2372}
}
EUVIMED