The Cycle Counts of Graphs
Graphs and Combinatorics · 2026-06 · 42 (3)
DOI: 10.1007/s00373-026-03047-3 ↗Kurz gefasst
Fachartikel in der Zeitschrift Graphs and Combinatorics, online erschienen am 01.06.2026. Verfasst von Ryan McCulloch und 3 weiteren Autor:innen. Die Arbeit nennt 7 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Australian Research Council.
Abstract (Originalsprache)
We prove that an inseparable graph can have any positive number of cycles with the six exceptions 2, 4, 5, 8, 9, 16, and that an inseparable cubic graph has the additional exceptions 1 and 13. The exceptions for simple inseparable cubic graphs are unknown.
Förderung
- Australian Research Council
Zitieren
APA
McCulloch, R., McKay, B. D., Salahshoori, A., & Zaslavsky, T. (2026). The Cycle Counts of Graphs. Graphs and Combinatorics, 42(3). https://doi.org/10.1007/s00373-026-03047-3
Vancouver
McCulloch R, McKay BD, Salahshoori A, Zaslavsky T. The Cycle Counts of Graphs. Graphs and Combinatorics. 2026;42(3). doi:10.1007/s00373-026-03047-3
BibTeX
@article{McCulloch2026,
author = {McCulloch, Ryan and McKay, Brendan D. and Salahshoori, Alireza and Zaslavsky, Thomas},
title = {The Cycle Counts of Graphs},
journal = {Graphs and Combinatorics},
year = {2026},
volume = {42},
number = {3},
doi = {10.1007/s00373-026-03047-3}
}
EUVIMED