| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:General lower bounds for the minor crossing number of graphs
Authors:ID Bokal, Drago (Author)
ID Czabarka, Éva (Author)
ID Székely, László (Author)
ID Vrt'o, Imrich (Author)
Files:URL http://www.imfm.si/preprinti/PDF/01054.pdf
 
Language:English
Work type:Not categorized
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:There are three general lower bound techniques for the crossing numbers of graphs: the Crossing Lemma, the bisection method and the embedding method. Inthis contribution, we present their adaptations to the minor crossing number. Using the adapted bounds, we improve on the known bounds on the minor crossing number of hypercubes. We also point out relations of the minor crossing number to string graphs.
Keywords:teorija grafov, prekrižno število, minor, hiper kocke, graph theory, minor crossing number, graph minor, string graphs, hypercubes
Year of publishing:2008
Number of pages:str. 1-15
Numbering:Vol. 46, št. 1054
PID:20.500.12556/DKUM-51676 New window
ISSN:1318-4865
UDC:519.17
COBISS.SI-ID:14795353 New window
NUK URN:URN:SI:UM:DK:1ETCGVYU
Publication date in DKUM:10.07.2015
Views:1217
Downloads:123
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica