outerplanar

常見(jiàn)例句

• In this paper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it.
  本文主要考慮外平面圖中的反饋點(diǎn)集并給出了一個(gè)求外平面圖最小頂點(diǎn)賦權(quán)反饋點(diǎn)集的線性時(shí)間算法。
• Meanwhile, we propose some descriptions on (2， 1)-coloring of outerplanar graphs with and without cut vertices, respectively.
  并分別給出了無(wú)割點(diǎn)極大外可平面 圖和有割點(diǎn)極大外可平面圖(2， 1)-可染的刻畫(huà).
• Game Chromatic Number of Outerplanar Graph
  外平面圖的對(duì)策色數(shù)
• The Incidence Coloring Number of Maximal Outerplanar Graph
  極大外平面圖的關(guān)聯(lián)色數(shù)
• Minimum Cycle Bases of Outerplanar Graphs on the Projective Plane
  射影平面上外可平面圖的最小圈基
• A Note on the Edge-face Total Chromatic Number of Maximal Outerplanar Graphs
  極大外平面圖邊面全色數(shù)的注記
返回 outerplanar