Union of all the minimum cycle bases of a graph.

Vismara, Philippe

The Electronic Journal of Combinatorics [electronic only] (1997)

  • Volume: 4, Issue: 1, page Research paper R9, 15 p.-Research paper R9, 15 p.
  • ISSN: 1077-8926

How to cite

top

Vismara, Philippe. "Union of all the minimum cycle bases of a graph.." The Electronic Journal of Combinatorics [electronic only] 4.1 (1997): Research paper R9, 15 p.-Research paper R9, 15 p.. <http://eudml.org/doc/227545>.

@article{Vismara1997,
author = {Vismara, Philippe},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {cyclic structures; cycle bases; relevant cycle; polynomial algorithm},
language = {eng},
number = {1},
pages = {Research paper R9, 15 p.-Research paper R9, 15 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Union of all the minimum cycle bases of a graph.},
url = {http://eudml.org/doc/227545},
volume = {4},
year = {1997},
}

TY - JOUR
AU - Vismara, Philippe
TI - Union of all the minimum cycle bases of a graph.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1997
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 4
IS - 1
SP - Research paper R9, 15 p.
EP - Research paper R9, 15 p.
LA - eng
KW - cyclic structures; cycle bases; relevant cycle; polynomial algorithm
UR - http://eudml.org/doc/227545
ER -

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.