On the decomposition of complete directed graphs into factors with given radii
Eliška Tomová (1986)
Mathematica Slovaca
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Complexity of decomposing graphs into factors with given diameters or radii”
On the decomposition of complete directed graphs into factors with given radii
Bipartite toughness and -factors in bipartite graphs.
Liu, Guizhen, Qian, Jianbo, Sun, Jonathan Z., Xu, Rui (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The bigraph decomposition number of a graph
Bohdan Zelinka (1988)
Časopis pro pěstování matematiky
Similarity:
On -closed graphs
Pavel Tomasta, Eliška Tomová (1988)
Czechoslovak Mathematical Journal
Similarity: