| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font
First page > Show document

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://dx.doi.org/10.1007/s00454-010-9245-4
 
Language:English
Work type:Not categorized
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Obstajajo tri splošne spodnje meje za minorsko prekrižno število grafov: prekrižna lema, metoda z bisekcijo in metoda z vložitvami. V tem prispevku predstavimo njihove prilagoditve za minorsko prekrižno število grafov. S tako pridobljenimi spodnjimi mejami izboljšamo znane rezultate za minorsko prekrižno število hiperkock. Poleg navedenih rezultatov predstavimo tudi povezavo med minorskim prekrižnim številom in grafi, predstavljivimi s krivuljami (string-graphs).
Keywords:teorija grafov, minorsko prekrižno število, grafovski minor, krivuljski grafi, hiper kocke, graph theory, minor crossing number, graph minor, string graphs, hypercubes
Year of publishing:2010
Number of pages:str. 463-483
Numbering:Vol. 44, no. 2
PID:20.500.12556/DKUM-51865 New window
UDC:519.17
ISSN on article:0179-5376
COBISS.SI-ID:15636057 New window
NUK URN:URN:SI:UM:DK:8UNNVG4G
Publication date in DKUM:10.07.2015
Views:1075
Downloads:100
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
BOKAL, Drago, CZABARKA, Éva, SZÉKELY, László and VRT’O, Imrich, 2010, General lower bounds for the minor crossing number of graphs. Discrete & computational geometry [online]. 2010. Vol. 44, no. 2, p. 463–483. [Accessed 3 April 2025]. Retrieved from: http://dx.doi.org/10.1007/s00454-010-9245-4
Copy citation
  
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Similar works from other repositories:

No similar works found

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:Discrete & computational geometry
Shortened title:Discrete comput. geom.
Publisher:Springer
ISSN:0179-5376
COBISS.SI-ID:25342208 New window

Secondary language

Language:Unknown
Title:Splošne spodnje meje za minorsko prekrižno število grafov
Abstract:There are three general lower bound techniques for the crossing numbers of graphs: the Crossing Lemma, the bisection method and the embedding method. In this 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.


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