Total chromatic number of planar graphs with maximum degree ten

By Weifan Wang. 2007

90 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/b52d92823c161566fe0f17598681b1ccd9d9b2f2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Zsolt Tuza
2. Csilla Bujtás

In Computer Graphics and Computer-Aided Design

1. Zsolt Tuza
2. Csilla Bujtás

In Discrete Mathematics and Combinatorics

1. Zsolt Tuza
2. Csilla Bujtás

Citations in the corpus

• C-perfect hypergraphs (2010, background): “We note that our theorem implies the result of Fox and Lin [ 6 ] that s(Ka;b) = 2 minfa; bg 1 for every a 1; b 1, but our construction is dieren t from theirs.”