-
Immersing small complete graphs [Elektronski vir]DeVos, Matt ...Following in the spirit of the Hadwiger and Hajós conjectures, Abu-Khzam and Langston have conjectured that every ▫$k$▫-chromatic graph contains an immersion of ▫$K_k$▫. They proved this for ▫$k \le ... 4$▫. Here we make the stronger conjecture that every simple graph of minimum degree ▫$k-1$▫ contains an immersion of ▫$K_{k}$▫. We prove that this conjecture holds for every ▫$k \le 7$▫.Source: Preprint series. - ISSN 1318-4865 (Vol. 47, št. 1077, 2009, str. 1-9)Type of material - e-articlePublish date - 2009Language - englishCOBISS.SI-ID - 15050585
Author
DeVos, Matt |
Kawarabayashi, Ken-ichi |
Mohar, Bojan, 1956- |
Okamura, Haruko
Topics
matematika |
teorija grafov |
imerzija |
Hadwigerjeva domneva |
Hajóseva domneva |
kromatično število |
mathematics |
graph theory |
immersion |
Hadwiger conjecture |
Hajós conjecture |
edge-connectivity |
chromatic number
![loading ... loading ...](themes/default/img/ajax-loading.gif)
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 |
---|---|
DeVos, Matt | ![]() |
Kawarabayashi, Ken-ichi | ![]() |
Mohar, Bojan, 1956- | 01931 |
Okamura, Haruko | ![]() |
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.