Total weight choosability of graphs.
Przybyło, Jakub; Woźniak, Mariusz
The Electronic Journal of Combinatorics [electronic only] (2011)
- Volume: 18, Issue: 1, page Research Paper P112, 11 p., electronic only-Research Paper P112, 11 p., electronic only
- ISSN: 1077-8926
Access Full Article
top
How to cite
topPrzybyło, Jakub, and Woźniak, Mariusz. "Total weight choosability of graphs.." The Electronic Journal of Combinatorics [electronic only] 18.1 (2011): Research Paper P112, 11 p., electronic only-Research Paper P112, 11 p., electronic only. <http://eudml.org/doc/232266>.
@article{Przybyło2011,
author = {Przybyło, Jakub, Woźniak, Mariusz},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {graph labelling; neighbour distinguishing total weighting; total list weighting; vertex colouring},
language = {eng},
number = {1},
pages = {Research Paper P112, 11 p., electronic only-Research Paper P112, 11 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Total weight choosability of graphs.},
url = {http://eudml.org/doc/232266},
volume = {18},
year = {2011},
}
TY - JOUR
AU - Przybyło, Jakub
AU - Woźniak, Mariusz
TI - Total weight choosability of graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2011
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 18
IS - 1
SP - Research Paper P112, 11 p., electronic only
EP - Research Paper P112, 11 p., electronic only
LA - eng
KW - graph labelling; neighbour distinguishing total weighting; total list weighting; vertex colouring
UR - http://eudml.org/doc/232266
ER -
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.