Interchangeability of relevant cycles in graphs.
Gleiss, Petra M.; Leydold, Josef; Stadler, Peter F.
The Electronic Journal of Combinatorics [electronic only] (2000)
- Volume: 7, Issue: 1, page Research paper R16, 16 p.-Research paper R16, 16 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topGleiss, Petra M., Leydold, Josef, and Stadler, Peter F.. "Interchangeability of relevant cycles in graphs.." The Electronic Journal of Combinatorics [electronic only] 7.1 (2000): Research paper R16, 16 p.-Research paper R16, 16 p.. <http://eudml.org/doc/120353>.
@article{Gleiss2000,
author = {Gleiss, Petra M., Leydold, Josef, Stadler, Peter F.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {minimum cycle basis; relevant cycles},
language = {eng},
number = {1},
pages = {Research paper R16, 16 p.-Research paper R16, 16 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Interchangeability of relevant cycles in graphs.},
url = {http://eudml.org/doc/120353},
volume = {7},
year = {2000},
}
TY - JOUR
AU - Gleiss, Petra M.
AU - Leydold, Josef
AU - Stadler, Peter F.
TI - Interchangeability of relevant cycles in graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2000
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 7
IS - 1
SP - Research paper R16, 16 p.
EP - Research paper R16, 16 p.
LA - eng
KW - minimum cycle basis; relevant cycles
UR - http://eudml.org/doc/120353
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.