2014
DOI: 10.1016/j.tcs.2013.07.027
|View full text |Cite
|
Sign up to set email alerts
|

Edge colorings of planar graphs without 5-cycles with two chords

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…(1) Δ ≥ 3 and g ≥ 8, or Δ ≥ 4 and g ≥ 5, or Δ ≥ 5 and g ≥ 4 ([1]) (2) Δ ≥ 6 without intersecting 3-cycles ( [4]) (3) Δ ≥ 6 without 4-or 5-cycles ( [5]) (4) Δ ≥ 6 without 5-or 6-cycles with chords [6] (5) Δ ≥ 6 without 5-cycles ( [7]) or 6-cycles ( [8]) with two chords (6) Δ ≥ 6 without 7-cycles ( [9]) or 6-cycles ( [10]) with three chords (7) Δ ≥ 6 and any vertex is incident with at most three triangles ( [11]) (8) Δ ≥ 6 and without adjacent k-cycles, where 3 ≤ k ≤ 6…”
Section: Theoremmentioning
confidence: 99%
“…(1) Δ ≥ 3 and g ≥ 8, or Δ ≥ 4 and g ≥ 5, or Δ ≥ 5 and g ≥ 4 ([1]) (2) Δ ≥ 6 without intersecting 3-cycles ( [4]) (3) Δ ≥ 6 without 4-or 5-cycles ( [5]) (4) Δ ≥ 6 without 5-or 6-cycles with chords [6] (5) Δ ≥ 6 without 5-cycles ( [7]) or 6-cycles ( [8]) with two chords (6) Δ ≥ 6 without 7-cycles ( [9]) or 6-cycles ( [10]) with three chords (7) Δ ≥ 6 and any vertex is incident with at most three triangles ( [11]) (8) Δ ≥ 6 and without adjacent k-cycles, where 3 ≤ k ≤ 6…”
Section: Theoremmentioning
confidence: 99%