Diagonal coloring of the vertices of triangulations

DOI10.1016/0012-365X(92)90352-GzbMath0754.05036OpenAlexW1972313810MaRDI QIDQ1193436

Oleg V. Borodin

Publication date: 27 September 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90352-g

zbMATH Keywords

upper bounddiagonal coloring of triangulations

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Borodin's conjecture on diagonal coloring is false ⋮ On cyclic colorings and their generalizations

Cites Work

• Unnamed Item