Partitioning a graph into cycles with a specified number of chords

DOI10.1002/jgt.22534zbMath1485.05144arXiv1808.03893OpenAlexW2998277453MaRDI QIDQ5066898

Shuya Chiba, Jin Yan, Su-yun Jiang

Publication date: 31 March 2022

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.03893

zbMATH Keywords

partitionscyclesdegree sum conditionschorded cycles

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Results and problems on chorded cycles: a survey

This page was built for publication: Partitioning a graph into cycles with a specified number of chords