# Paths of specified length in random $k$-partite graphs.

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2001)

- Volume: 4, Issue: 2, page 133-138 p.
- ISSN: 1365-8050

## Access Full Article

top## How to cite

topSubramanian, C.R.. "Paths of specified length in random -partite graphs.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 4.2 (2001): 133-138 p.. <http://eudml.org/doc/121632>.

@article{Subramanian2001,

author = {Subramanian, C.R.},

journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},

keywords = {bijections; paths; random graphs},

language = {eng},

number = {2},

pages = {133-138 p.},

publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},

title = {Paths of specified length in random -partite graphs.},

url = {http://eudml.org/doc/121632},

volume = {4},

year = {2001},

}

TY - JOUR

AU - Subramanian, C.R.

TI - Paths of specified length in random -partite graphs.

JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

PY - 2001

PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD

VL - 4

IS - 2

SP - 133

EP - 138 p.

LA - eng

KW - bijections; paths; random graphs

UR - http://eudml.org/doc/121632

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.