Skip to main content Accesibility Help
×
×
Home

Longest Paths in Circular Arc Graphs

  • PAUL N. BALISTER (a1), ERVIN GYÖRI (a2), JENÖ LEHEL (a3) and RICHARD H. SCHELP (a4)
Abstract

We show that all maximum length paths in a connected circular arc graph have non-empty intersection.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed