Route systems and bipartite graphs
Czechoslovak Mathematical Journal (1991)
- Volume: 41, Issue: 2, page 260-264
- ISSN: 0011-4642
Access Full Article
top
How to cite
topNebeský, Ladislav. "Route systems and bipartite graphs." Czechoslovak Mathematical Journal 41.2 (1991): 260-264. <http://eudml.org/doc/13922>.
@article{Nebeský1991,
author = {Nebeský, Ladislav},
journal = {Czechoslovak Mathematical Journal},
keywords = {bipartite graphs; route systems; shortest paths; connected bipartite graphs},
language = {eng},
number = {2},
pages = {260-264},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Route systems and bipartite graphs},
url = {http://eudml.org/doc/13922},
volume = {41},
year = {1991},
}
TY - JOUR
AU - Nebeský, Ladislav
TI - Route systems and bipartite graphs
JO - Czechoslovak Mathematical Journal
PY - 1991
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 41
IS - 2
SP - 260
EP - 264
LA - eng
KW - bipartite graphs; route systems; shortest paths; connected bipartite graphs
UR - http://eudml.org/doc/13922
ER -
References
top- M. Behzad G. Chartrand, and L. Lesniak-Foster, Graphs & Digraphs, Prindle, Weber & Schmidt, Boston 1979. (1979) MR0525578
- L. Nebeský, On certain extensions of intervals in graphs, . Časopis pěst. mat. 115, 1990, 171-177. (1990) MR1054004
Citations in EuDML Documents
topNotesEmbed ?
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.