Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Intersecting longest paths and longest cycles: A survey

Electronic Journal of Graph Theory and Applications · Vol. 1 No. 1 (2013) · hlm. 56–76

DOI
10.5614/ejgta.2013.1.1.6
ISSN
2338-2287
Terbit
2013-04-30
Penerbit
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
Bahasa
eng

Abstrak

This is a survey of results obtained during the last 45 years regarding the intersection behaviour of all longest paths, or all longest cycles, in connected graphs. Planar graphs and graphs of higher connectivity receive special attention. Graphs embeddable in the cubic lattice of arbitrary dimension, and graphs embeddable in the triangular or hexagonal lattice of the plane are also discussed.Results concerning the case when not all, but just some longest paths or cycles are intersected, for example two or three of them, are also reported.

Kata kunci

Jaringan kolaborasi para penulis

3 penulis · 3 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) http://www.ejgta.org/index.php/ejgta/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Intersecting longest paths and longest cycles: A survey</dc:title>
	<dc:creator>Shabbir, Ayesha; "Abdus Salam" School of Mathematical Sciences, GC University, 68-B, New Muslim Town, Lahore</dc:creator>
	<dc:creator>Zamfirescu, Carol T.; Faculty of Mathematics, University of Dortmund, Dortmund</dc:creator>
	<dc:creator>Zamfirescu, Tudor I.; "Simion Stoilow” Institute of Mathematics, Roumanian Academy, Bucharest</dc:creator>
	<dc:subject xml:lang="en-US">longest path, longest cycle, planar graph, lattice, torus, Mobius strip, Klein bottle</dc:subject>
	<dc:description xml:lang="en-US">This is a survey of results obtained during the last 45 years regarding the intersection behaviour of all longest paths, or all longest cycles, in connected graphs. Planar graphs and graphs of higher connectivity receive special attention. Graphs embeddable in the cubic lattice of arbitrary dimension, and graphs embeddable in the triangular or hexagonal lattice of the plane are also discussed.Results concerning the case when not all, but just some longest paths or cycles are intersected, for example two or three of them, are also reported.</dc:description>
	<dc:publisher xml:lang="en-US">GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2013-04-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>http://www.ejgta.org/index.php/ejgta/article/view/19</dc:identifier>
	<dc:identifier>10.5614/ejgta.2013.1.1.6</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 1, No 1 (2013): Electronic Journal of Graph Theory and Applications; 56 - 76</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/19/6</dc:relation>
</oai_dc:dc>