We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
'The Institute for Research and Community Services (LPPM) ITB'
Doi
Abstract
In this note, we consider triangular, square and hexagonal lattices on the flat Klein bottle, and find subgraphs with the property that for any j vertices there exists a longest path (cycle) avoiding all of them. This completes work previously done in other lattices.</p
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.