Bound vertices of longest paths between two vertices in cubic graphs

Documenti analoghi

• Chords of longest cycles in graphs with large circumferences
  di: Wu, Haidong, et al.
  Pubblicazione: (2025)
• The minimum size of a $3$-connected locally nonforesty graph
  di: Li, Chengli, et al.
  Pubblicazione: (2024)
• The minimum size of a $k$-connected locally nonforesty graph
  di: Li, Chengli, et al.
  Pubblicazione: (2025)
• The detour covering number and cummerbund covering number of a graph
  di: Li, Chengli, et al.
  Pubblicazione: (2025)
• Chords of longest cycles passing through a specified small set
  di: Wu, Haidong, et al.
  Pubblicazione: (2025)