2003
DOI: 10.1016/s0012-365x(03)00049-9
|View full text |Cite
|
Sign up to set email alerts
|

The total chromatic number of graphs of even order and high degree

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2005
2005
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…Other results on the total coloring of graphs are referred to [15][16][17]. In this paper we show that the TCC is true for regular graphs G having d(G) 2 3 |V (G)| + 23 6 .…”
Section: Introductionmentioning
confidence: 69%
“…Other results on the total coloring of graphs are referred to [15][16][17]. In this paper we show that the TCC is true for regular graphs G having d(G) 2 3 |V (G)| + 23 6 .…”
Section: Introductionmentioning
confidence: 69%