The bigraph decomposition number of a graph

Bohdan Zelinka

Časopis pro pěstování matematiky (1988)

  • Volume: 113, Issue: 1, page 56-59
  • ISSN: 0528-2195

How to cite

top

Zelinka, Bohdan. "The bigraph decomposition number of a graph." Časopis pro pěstování matematiky 113.1 (1988): 56-59. <http://eudml.org/doc/21698>.

@article{Zelinka1988,
author = {Zelinka, Bohdan},
journal = {Časopis pro pěstování matematiky},
keywords = {bigraph decomposition number; minimum number of edge-disjoint complete bipartite graphs},
language = {eng},
number = {1},
pages = {56-59},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {The bigraph decomposition number of a graph},
url = {http://eudml.org/doc/21698},
volume = {113},
year = {1988},
}

TY - JOUR
AU - Zelinka, Bohdan
TI - The bigraph decomposition number of a graph
JO - Časopis pro pěstování matematiky
PY - 1988
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 113
IS - 1
SP - 56
EP - 59
LA - eng
KW - bigraph decomposition number; minimum number of edge-disjoint complete bipartite graphs
UR - http://eudml.org/doc/21698
ER -

References

top
  1. Problem Sessions, In: Graphs and Order. Proc. Conf. Banff 1984. (1984) 

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.