-
▫$K_{3,k}$▫-minors in large 7-connected graphs [Elektronski vir]Böhme, Thomas ...It is shown that for any positive integer ▫$k$▫ there exists a constant ▫$N = N(k)$▫ such that every 7-connected graph of order at least ▫$N$▫ contains ▫$K_{3,k}$▫ as a minor.Source: Preprint series. - ISSN 1318-4865 (Vol. 46, št. 1051, 2008, str. 1-23)Type of material - e-articlePublish date - 2008Language - englishCOBISS.SI-ID - 14678617
Author
Böhme, Thomas |
Kawarabayashi, Ken-ichi |
Maharry, John |
Mohar, Bojan, 1956-
Topics
matematika |
teorija grafov |
minor grafa |
povezanost |
drevesna širina |
Hadwigerjeva hipoteza |
▫$k$▫-prepleteni graf |
grafi na ploskvah |
Eulerjeva formula |
lastnost Erdősa in Póse |
mathematics |
graph theory |
graph minor |
connectivity |
tree-width |
tree-decomposition |
path-decomposition |
complete graph minor |
unavoidable minor |
▫$k$▫-linked |
Hadwiger conjecture |
grid minor |
Vortex structure |
near embedding |
graphs on surfaces |
Euler's formula |
Erdős-Pósa property
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|---|
Böhme, Thomas | |
Kawarabayashi, Ken-ichi | |
Maharry, John | |
Mohar, Bojan, 1956- | 01931 |
Select pickup location:
Material pickup by post
Notification
Subject headings in COBISS General List of Subject Headings
Select pickup location
Pickup location | Material status | Reservation |
---|
Please wait a moment.