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:
On prism-hamiltonian bipartite graphs
Authors:
ID
Špacapan, Simon
(
Author
)
ID
Horak, Peter
(
Author
)
Files:
ajc_v88_p194.pdf
(293,06 KB)
MD5: 3FB617856E917F5B3F38241DC35D7703
https://ajc.maths.uq.edu.au/pdf/88/ajc_v88_p194.pdf
Language:
English
Work type:
Article
Typology:
1.01 - Original Scientific Article
Organization:
FS - Faculty of Mechanical Engineering
Abstract:
A graph G is prism-hamiltonian if the prism over G, the Cartesian product of G with the complete graph K2, is hamiltonian. In this article a characterization of prism-hamiltonian graphs is provided. Kaiser et al. conjectured that every graph with sufficiently high toughness is prismhamiltonian. We prove a special case of this conjecture, namely that every 1-tough bipartite graph which has no adjacent vertices of degree at least four is prism-hamiltonian.
Keywords:
graphs theory
,
graph G
Publication status:
Published
Publication version:
Version of Record
Submitted for review:
07.02.2023
Article acceptance date:
17.01.2024
Publication date:
01.02.2024
Publisher:
University of Queensland, Australia
Year of publishing:
2024
Number of pages:
str. 194-203
Numbering:
Vol. 88, no. 2
PID:
20.500.12556/DKUM-96779
UDC:
519.17
ISSN on article:
2202-3518
COBISS.SI-ID:
197089027
Copyright:
© The author(s)
Publication date in DKUM:
28.01.2026
Views:
263
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:
Theǂ Australasian journal of combinatorics
Publisher:
Centre for Discrete Mathematics and Computing, University of Queensland
ISSN:
2202-3518
COBISS.SI-ID:
17399897
Document is financed by a project
Funder:
ARIS - Slovenian Research and Innovation Agency
Funding programme:
ARRS Slovenia
Project number:
BI-US/18-20-100
Name:
Bilateral project
Licences
License:
CC BY-ND 4.0, Creative Commons Attribution-NoDerivatives 4.0 International
Link:
http://creativecommons.org/licenses/by-nd/4.0/
Description:
Under the NoDerivatives Creative Commons license one can take a work released under this license and re-distribute it, but it cannot be shared with others in adapted form, and credit must be provided to the author.
Secondary language
Language:
Slovenian
Keywords:
teorija grafov
,
graf G
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
