A note on packing graphs without cycles of length up to five.
Görlich, Agnieszka; Żak, Andrzej
The Electronic Journal of Combinatorics [electronic only] (2009)
- Volume: 16, Issue: 1, page Research Paper N30, 3 p.-Research Paper N30, 3 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topGörlich, Agnieszka, and Żak, Andrzej. "A note on packing graphs without cycles of length up to five.." The Electronic Journal of Combinatorics [electronic only] 16.1 (2009): Research Paper N30, 3 p.-Research Paper N30, 3 p.. <http://eudml.org/doc/228911>.
@article{Görlich2009,
author = {Görlich, Agnieszka, Żak, Andrzej},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research Paper N30, 3 p.-Research Paper N30, 3 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {A note on packing graphs without cycles of length up to five.},
url = {http://eudml.org/doc/228911},
volume = {16},
year = {2009},
}
TY - JOUR
AU - Görlich, Agnieszka
AU - Żak, Andrzej
TI - A note on packing graphs without cycles of length up to five.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2009
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 16
IS - 1
SP - Research Paper N30, 3 p.
EP - Research Paper N30, 3 p.
LA - eng
UR - http://eudml.org/doc/228911
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.