Melola Discovery

← Melola Discovery

Jurnal SINTA 1

A Note Concerning Hamilton Cycles in Some Classes of Grid Graphs

Journal of Mathematical and Fundamental Sciences · Vol. 35 No. 1 (2013) · hlm. 65–70

DOI
10.5614/itbj.sci.2003.35.1.5
ISSN
2338-5510, 2337-5760
Terbit
2013-12-28
Penerbit
Directorate for Research and Innovation (DRI) ITB
Bahasa
eng

Abstrak

A graph G is called hamiltonian if it contains a Hamilton cycle, i.e. a cycle containing all vertices. Deciding whether a given graph has a Hamilton cycle is an NP-complete problem. But, it is a polynomial problem within some special graph classes. In this paper we consider three classes of grid graphs, namely rectangular grid graph, eta grid graph and omega grid graph. Our main result characterizes which of these graphs are hamiltonian.

Jaringan kolaborasi para penulis

19 penulis · 26 tautan kepenulisan bersama · 9 lintas organisasi

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

  • Bandung Institute of Technology
  • Politeknik Negeri Malang
  • Riau University
  • Universitas Muhammadiyah Malang
  • Hasanuddin University
  • Sunan Gunung Djati State Islamic University Bandung
  • University of Indonesia
  • Organisasi lain
  • 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
Hilda AssiyatunBandung Institute of Technology2
Ratnaning PalupiPoliteknik Negeri Malang1
Efni AgustiariniRiau University1
Shariefuddin; University of Kashmir PirzadaAfiliasi tidak diketahui1
Hilal A; University of Kashmir GanieAfiliasi tidak diketahui1
Asmiati AsmiatiBandung Institute of Technology1
Yus Mochamad CholilyUniversitas Muhammadiyah Malang1
Nurdin NurdinHasanuddin University1
Muhammad Kamran SiddiquiAfiliasi tidak diketahui1
Hilda AssiyatunAfiliasi tidak diketahui1
Rismawati RamdaniSunan Gunung Djati State Islamic University Bandung1
Dian Kastika SyofyanBandung Institute of Technology1
Denny Riama SilabanUniversity of Indonesia1
Saladin UttunggadewaBandung Institute of Technology1
Anie LusianiPoliteknik Negeri Bandung1
Suhadi Wido SaputroBandung Institute of Technology1

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) https://journals.itb.ac.id/index.php/jmfs/oai, pertama di-harvest 9 Nov 2026, terakhir terlihat 16 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">A Note Concerning Hamilton Cycles in Some Classes of Grid Graphs</dc:title>
	<dc:creator>Salman, A. N.M.</dc:creator>
	<dc:creator>Baskoro, E. T.</dc:creator>
	<dc:creator>Broersma, H. J.</dc:creator>
	<dc:description xml:lang="en-US">A graph G is called hamiltonian if it contains a Hamilton cycle, i.e. a cycle containing all vertices. Deciding whether a given graph has a Hamilton cycle is an NP-complete problem. But, it is a polynomial problem within some special graph classes. In this paper we consider three classes of grid graphs, namely rectangular grid graph, eta grid graph and omega grid graph. Our main result characterizes which of these graphs are hamiltonian. </dc:description>
	<dc:publisher xml:lang="en-US">Directorate for Research and Innovation (DRI) ITB</dc:publisher>
	<dc:date>2013-12-28</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journals.itb.ac.id/index.php/jmfs/article/view/257</dc:identifier>
	<dc:identifier>10.5614/itbj.sci.2003.35.1.5</dc:identifier>
	<dc:source xml:lang="en-US">Journal of Mathematical and Fundamental Sciences; Vol. 35 No. 1 (2003); 65-70</dc:source>
	<dc:source>2338-5510</dc:source>
	<dc:source>2337-5760</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journals.itb.ac.id/index.php/jmfs/article/view/257/239</dc:relation>
</oai_dc:dc>