On the total coloring of planar graphs.
Journal für die reine und angewandte Mathematik (1989)
- Volume: 394, page 180-185
- ISSN: 0075-4102; 1435-5345/e
Access Full Article
top
How to cite
topBorodin, O.V.. "On the total coloring of planar graphs.." Journal für die reine und angewandte Mathematik 394 (1989): 180-185. <http://eudml.org/doc/153105>.
@article{Borodin1989,
author = {Borodin, O.V.},
journal = {Journal für die reine und angewandte Mathematik},
keywords = {total chromatic number; maximal degree; planar graphs},
pages = {180-185},
title = {On the total coloring of planar graphs.},
url = {http://eudml.org/doc/153105},
volume = {394},
year = {1989},
}
TY - JOUR
AU - Borodin, O.V.
TI - On the total coloring of planar graphs.
JO - Journal für die reine und angewandte Mathematik
PY - 1989
VL - 394
SP - 180
EP - 185
KW - total chromatic number; maximal degree; planar graphs
UR - http://eudml.org/doc/153105
ER -
Citations in EuDML Documents
top- Daniel W. Cranston, Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
- Ping Wang, Jian-Liang Wu, A note on total colorings of planar graphs without 4-cycles
- Oleg V. Borodin, Precise lower bound for the number of edges of minor weight in planar maps
- Xin Zhang, Yong Yu, Guizhen Liu, On (p, 1)-total labelling of 1-planar graphs
- Arnfried Kemnitz, Peter Mihók, Margit Voigt, Fractional (P,Q)-Total List Colorings of Graphs
- Xinhui An, Baoyindureng Wu, The list linear arboricity of planar graphs
- Stanislav Jendroľ, Paths with restricted degrees of their vertices in planar graphs
- Mirko Horňák, Stanislav Jendrol, Unavoidable set of face types for planar maps
- Zsolt Tuza, Graph colorings with local constraints - a survey
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.