A note on graphs without short even cycles.
Lam, Thomas; Verstraëte, Jacques
The Electronic Journal of Combinatorics [electronic only] (2005)
- Volume: 12, Issue: 1, page Research paper N5, 6 p., electronic only-Research paper N5, 6 p., electronic only
- ISSN: 1077-8926
Access Full Article
top
How to cite
topLam, Thomas, and Verstraëte, Jacques. "A note on graphs without short even cycles.." The Electronic Journal of Combinatorics [electronic only] 12.1 (2005): Research paper N5, 6 p., electronic only-Research paper N5, 6 p., electronic only. <http://eudml.org/doc/124423>.
@article{Lam2005,
author = {Lam, Thomas, Verstraëte, Jacques},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {polarity graphs; polygons},
language = {eng},
number = {1},
pages = {Research paper N5, 6 p., electronic only-Research paper N5, 6 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {A note on graphs without short even cycles.},
url = {http://eudml.org/doc/124423},
volume = {12},
year = {2005},
}
TY - JOUR
AU - Lam, Thomas
AU - Verstraëte, Jacques
TI - A note on graphs without short even cycles.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2005
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 12
IS - 1
SP - Research paper N5, 6 p., electronic only
EP - Research paper N5, 6 p., electronic only
LA - eng
KW - polarity graphs; polygons
UR - http://eudml.org/doc/124423
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.