The minor crossing number of graphs with an excluded minor

Bokal, Drago; Fijavž, Gašper; Wood, David Richard

| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

First page > Show document

Show document

Title:	The minor crossing number of graphs with an excluded minor
Authors:	ID Bokal, Drago (Author) ID Fijavž, Gašper (Author) ID Wood, David Richard (Author)
Files:	Electronic_Journal_of_Combinatorics_2008_Bokal,_Fijavz,_Wood_The_minor_crossing_number_of_graphs_with_an_excluded_minor.pdf (189,15 KB) MD5: B9F88495CA4595ED69B58BAC52346722 http://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r4
Language:	English
Work type:	Scientific work
Typology:	1.01 - Original Scientific Article
Organization:	FNM - Faculty of Natural Sciences and Mathematics
Abstract:	The minor crossing number of a graph $G$ is the minimum crossing number of a graph that contains $G$ as a minor. It is proved that for every graph $H$ there is a constant $c$ , such that every graph $G$ with no $H$ -minor has minor crossing number at most $c\|V(G)\|$ .
Keywords:	mathematics, graph theory, graph minor, excluded minor, crossing number, minor crossing number
Publication status:	Published
Publication version:	Version of Record
Year of publishing:	2008
Number of pages:	str. 1-13
Numbering:	Letn. 15, št. 1
PID:	20.500.12556/DKUM-49376
ISSN:	1077-8926
UDC:	519.17
ISSN on article:	1077-8926
COBISS.SI-ID:	14499417
NUK URN:	URN:SI:UM:DK:OCLT2JGT
Publication date in DKUM:	10.07.2015
Views:	1176
Downloads:	250
Metadata:
Categories:	Misc.
:	BOKAL, Drago, FIJAVŽ, Gašper and WOOD, David Richard, 2008, The minor crossing number of graphs with an excluded minor. The Electronic journal of combinatorics [online]. 2008. Vol. 15, no. 1, p. 1–13. [Accessed 31 March 2025]. Retrieved from: https://dk.um.si/IzpisGradiva.php?lang=eng&id=49376 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:

Similar works from our repository:

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:	The Electronic journal of combinatorics
Shortened title:	Electron. j. comb.
Publisher:	N.J. Calkin and H.S. Wilf
ISSN:	1077-8926
COBISS.SI-ID:	6973785

Secondary language

Language:	Slovenian
Title:	Minorsko prekrižno število grafov s prepovedanim minorjem
Abstract:	Minorsko prekrižno število grafa $G$ je najmanjše prekrižno število kakega grafa, ki vsebuje $G$ kot minor. V prispevku pokažemo, da za vsak graf $H$ obstaja konstanta $c>0$ , tako da ima vsak graf brez $H$ -minorja minorsko prekrižno število enako največ $c\|V(G)\|$ .
Keywords:	matematika, teorija grafov, graf, grafovski minor, prepovedan minor, prekrižno število, minorsko prekrižno število

Comments

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back