Hamiltonicity of Topological Grid Graphs

dc.creatorZamfirescu,Christina
dc.creatorZamfirescu,Tudor
dc.date2007
dc.date.accessioned2024-02-06T12:55:58Z
dc.date.available2024-02-06T12:55:58Z
dc.descriptionIn this paper we study connectivity and hamiltonicity properties of the topological grid graphs, which are a natural type of planar graphs associated with finite subgraphs of the usual square lattice graph of the plane. The main results are as follows. The shortness coefficient of the family of all topological grid graphs is at most 16/17. Every 3-connected topological grid graph is hamiltonian.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-013-11-1791
dc.identifierhttps://lib.jucs.org/article/28902/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/9538
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 13(11): 1791-1800
dc.subjectgrid graph
dc.subjecttopological grid graph
dc.subjecthamiltonian graph
dc.subjectshortness coefficient
dc.subject3-connectedness
dc.titleHamiltonicity of Topological Grid Graphs
dc.typeResearch Article
Файлы
Коллекции