✦ LIBER ✦

Edge Maximal Non-Bipartite Graphs Without Odd Cycles of Prescribed Lengths

✍ Scribed by Louis Caccetta; Rui-Zhong Jia

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian cycles through prescribed ed

✍ F. Göring; J. Harant 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 251 KB

On relating edges in graphs without cycl

✍ Levit, Vadim E.; Tankus, David 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 246 KB

List Edge Coloring of Planar Graphs With

✍ Cai, Jiansheng 📂 Article 📅 2014 🏛 Springer Japan 🌐 English ⚖ 140 KB

New Constructions of Bipartite Graphs on

✍ F. Lazebnik; V.A. Ustimenko; A.J. Woldar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 293 KB

A tight bound on the length of odd cycle

✍ Mehrnoush Malekesmaeili; Cedric Chauve; Tamon Stephen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 296 KB