We call such a spanning subgraph t an economical spanning subgraph . 我們稱這樣的生成子圖T為廉價(jià)的生成子圖。
These questions are special cases of the so called forbidden subgraph problem . 這些問(wèn)題都是所謂禁用子圖問(wèn)題的特殊情形。
If t is a subgraph of a graph g, then the edges of g not included in t are called links or chords . 如果T是圖G的一個(gè)子圖,則G中不包含在T中的邊稱為鏈支或弦。
The forbidden subgraph problem is a prime example of the rather large family of extremal problems is graph theory . 禁向子圖問(wèn)題是圖論中相當(dāng)大的一類極值問(wèn)題中的主要例子。
A well known problem in optimization theory asks for a relatively easy way of finding a spanning subgraph with a special property . 最優(yōu)化理論中的一個(gè)有名的問(wèn)題要求:用比較容易的方法來(lái)尋求具有某種特殊性質(zhì)的生成子圖。
It only remains to replace each edge of this diagram by a suitable subgraph which bears the information previously given by the direction and colour . 剩下要做的事只是用適當(dāng)?shù)淖訄D代替這個(gè)圖解的每條邊,使得原來(lái)用方向和顏色給出的信息由這個(gè)子圖來(lái)?yè)?dān)當(dāng)。
A note on maximum number of edges in a spanning eulerian subgraph 生成子圖極大邊數(shù)的一個(gè)注記
All you need to do is create your text in a subgraph 你所要做的是將你的文字創(chuàng)建在一個(gè)子圖中。
Tow maximal planar graphs with path bichromatic subgraph only 兩個(gè)只有路型二色子圖的極大平面圖
A method to probe into the number of edges of spanning eulerian subgraph 生成子圖邊數(shù)的一種方法