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:
A charaterization of planar median graphs
Authors:
ID
Peterin, Iztok
(
Author
)
Files:
Discussiones_Mathematicae_Graph_Theory_2006_Peterin_A_charaterization_of_planar_median_graphs.pdf
(137,39 KB)
MD5: 07BD705B95A056051225CBD327B81582
http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1299
Language:
English
Work type:
Unknown
Typology:
1.01 - Original Scientific Article
Organization:
FERI - Faculty of Electrical Engineering and Computer Science
Abstract:
Median graphs have many interesting properties. One of them is-in connection with triangle free graphs-the recognition complexity. In general the complexity is not very fast, but if we restrict to the planar case the recognition complexity becomes linear. Despite this fact, there is no characterization of planar median graphs in the literature. Here an additional condition is introduced for the convex expansion procedure that characterizes planar median graphs.
Keywords:
mathematics
,
graf theory
,
median graphs
,
planar graphs
,
expansion
Publication status:
Published
Publication version:
Version of Record
Year of publishing:
2006
Number of pages:
str. 41-48
Numbering:
Letn. 26, št. 1
PID:
20.500.12556/DKUM-65332
ISSN:
1234-3099
UDC:
519.17
ISSN on article:
1234-3099
COBISS.SI-ID:
14034009
NUK URN:
URN:SI:UM:DK:PES7NZFK
Publication date in DKUM:
31.03.2017
Views:
1187
Downloads:
1159
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:
Discussiones mathematicae. Graph theory
Shortened title:
Discuss. Math., Graph Theory
Publisher:
Technical University Press
ISSN:
1234-3099
COBISS.SI-ID:
7487065
Document is financed by a project
Funder:
ARRS - Slovenian Research Agency
Project number:
P1-0297
Name:
Teorija 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.
Licensing start date:
31.03.2017
Secondary language
Language:
Slovenian
Title:
Karakterizacija ravninskih medianskih grafov
Abstract:
Medianski grafi imajo mnogo zanimivih lastnosti. Ena izmed njih je, v povezavi z grafi brez trikotnikov, je časovna zahtevnost za prepoznavanje teh grafov. V splošnem ta zahtevnost ni zelo hitra. Če pa se omejimo na ravninske medianske grafe, je časovna zahtevnost linearna. Kljub temu dejstvu v literaturi ne obstaja karakterizacija ravninskih medianskih grafov. V članku je predstavljen dodaten pogoj h konveksni ekspanziji, ki nam karakterizira ravninske medianske grafe.
Keywords:
matematika
,
teorija grafov
,
medianski grafi
,
ravninski grafi
,
ekspanzija
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
