E-resources
-
Lo, Allan
Journal of graph theory, March 2019, 2019-03-00, 20190301, Volume: 90, Issue: 3Journal Article
Let G be an edge‐coloured graph. The minimum colour degree δ c ( G ) of G is the largest integer k such that, for every vertex v, there are at least k distinct colours on edges incident to v. We say that G is properly coloured if no two adjacent edges have the same colour. In this paper, we show that, for any ε > 0 and n large, every edge‐coloured graph G with δ c ( G ) ≥ ( 1 ∕ 2 + ε ) n contains a properly coloured cycle of length at least min { n , ⌊ 2 δ c ( G ) ∕ 3 ⌋ }.
Author
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:
If the library membership card is not in the list,
add a new one.
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 |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.