Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
Statistics
Login
First page
>
Show document
Show document
Title:
Polyhedra without cubic vertices are prism‐hamiltonian
Authors:
ID
Špacapan, Simon
(
Author
)
Files:
Journal_of_Graph_Theory_-_2024_-_Spacapan_-_Polyhedra_without_cubic_vertices_are_prism‐hamiltonian.pdf
(1,25 MB)
MD5: 007DAD65BEA09FFFAE93EAE211081EE5
https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23078
Language:
English
Work type:
Article
Typology:
1.01 - Original Scientific Article
Organization:
FS - Faculty of Mechanical Engineering
Abstract:
The prism over a graph G is the Cartesian product of Gwith the complete graph on two vertices. A graph G isprism‐hamiltonian if the prism over G is hamiltonian.We prove that every polyhedral graph (i.e., 3‐connectedplanar graph) of minimum degree at least four isprism‐hamiltonian.
Keywords:
circuit graph
,
Hamiltonian cycle
Publication status:
Published
Publication version:
Version of Record
Submitted for review:
09.04.2021
Article acceptance date:
22.01.2024
Publication date:
19.02.2024
Publisher:
Wiley
Year of publishing:
2024
Number of pages:
str. 380-406
Numbering:
Vol. 106, iss. 2
PID:
20.500.12556/DKUM-88852
UDC:
519.17
ISSN on article:
1097-0118
COBISS.SI-ID:
197097987
DOI:
10.1002/jgt.23078
Copyright:
© 2024 The Authors
Publication date in DKUM:
28.01.2026
Views:
105
Downloads:
3
Metadata:
Categories:
Misc.
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Average score:
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Record is a part of a journal
Title:
Journal of graph theory
Shortened title:
J. graph theory
Publisher:
J. Wiley & Sons
ISSN:
1097-0118
COBISS.SI-ID:
512820249
Document is financed by a project
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
P1-0297
Name:
Teorija grafov
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
J1-9109
Name:
Sodobne invariante grafov
Licences
License:
CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:
http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:
The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Secondary language
Language:
Slovenian
Keywords:
graf vezja
,
Hamiltonov cikel
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
