Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs

Documenti analoghi

• Spectral extremal problems for non-bipartite graphs without odd cycles
  di: Zou, Lantao, et al.
  Pubblicazione: (2025)
• Longest cycles and longest chordless cycles in $2$-connected graphs
  di: Hu, Yanan, et al.
  Pubblicazione: (2024)
• Proof a conjecture on connectivity keeping odd paths in k-connected bipartite graphs
  di: Yang, Qing, et al.
  Pubblicazione: (2022)
• On bipartite $(1,1,k)$-mixed graphs
  di: Dalfó, C., et al.
  Pubblicazione: (2024)
• The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs
  di: Ahn, Jungho, et al.
  Pubblicazione: (2022)