Semantic Scholar Open Access 2013 4 sitasi

Avoiding 5-Circuits in 2-Factors of Cubic Graphs

Barbora Candráková Robert Lukoťka

Lihat Sumber DOI

Abstrak

We show that every bridgeless cubic graph $G$ on $n$ vertices other than the Petersen graph has a 2-factor with at most $2(n-2)/15$ circuits of length $5$. An infinite family of graphs attains this bound. We also show that $G$ has a 2-factor with at most $n/5.8\overline{3}$ odd circuits. This improves the previously known bound of $n/5.41$ [Luko\v{t}ka, M\'a\v{c}ajov\'a, Maz\'ak, \v{S}koviera: Small snarks with large oddness, arXiv:1212.3641 [cs.DM] ].

Topik & Kata Kunci

Mathematics Computer Science

Penulis (2)

Barbora Candráková

Robert Lukoťka

Format Sitasi

APA MLA BibTeX

Candráková, B., Lukoťka, R. (2013). Avoiding 5-Circuits in 2-Factors of Cubic Graphs. https://doi.org/10.1137/130942966

Akses Cepat

Lihat di Sumber doi.org/10.1137/130942966

Informasi Jurnal

Tahun Terbit: 2013
Bahasa: en
Total Sitasi: 4×
Sumber Database: Semantic Scholar
DOI: 10.1137/130942966
Akses: Open Access ✓