Constrainted graph processes.

Bolobás, Béla; Riordan, Oliver

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

  • Volume: 7, Issue: 1, page Research paper R18, 20 p.-Research paper R18, 20 p.
  • ISSN: 1077-8926

How to cite

top

Bolobás, Béla, and Riordan, Oliver. "Constrainted graph processes.." The Electronic Journal of Combinatorics [electronic only] 7.1 (2000): Research paper R18, 20 p.-Research paper R18, 20 p.. <http://eudml.org/doc/120358>.

@article{Bolobás2000,
author = {Bolobás, Béla, Riordan, Oliver},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {random graphs},
language = {eng},
number = {1},
pages = {Research paper R18, 20 p.-Research paper R18, 20 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Constrainted graph processes.},
url = {http://eudml.org/doc/120358},
volume = {7},
year = {2000},
}

TY - JOUR
AU - Bolobás, Béla
AU - Riordan, Oliver
TI - Constrainted graph processes.
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 R18, 20 p.
EP - Research paper R18, 20 p.
LA - eng
KW - random graphs
UR - http://eudml.org/doc/120358
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.