Art

J-GLOBAL ID：200902102249963029   Reference number：01A0347866

Finding Completely Independent Spanning Trees in Maximal Planar Graphs.

極大平面グラフにおける完全独立全域木について

Author (1)： HASUNUMA T (Univ. Electro-Communications, Chofu, JPN)
Material： 電子情報通信学会技術研究報告  (IEICE Technical Report (Institute of Electronics, Information and Communication Engineers))
Volume： 100  Issue： 568(COMP2000 64-72)  Page： 55-62  Publication year： Jan. 22, 2001 
JST Material Number： S0532B  ISSN： 0913-5685  Document type： Proceedings
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *spanning tree ,...

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=01A0347866&from=J-GLOBAL&jstjournalNo=S0532B") }}

JST classification (1)： Basics of graph theory  (IA02020S)

Reference (15)：

• DI BATTISTA, G. Output-sensitive reporting of disjoint paths. Algorithmica. 1999, 23, 302-340
• CHERIYAN, J. Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J. Algorithms. 1988, 9, 507-537
• GAREY, M. R. Computers and Intractability-A Guide to the Theory of NP-Completeness. 1979
• GE, Z. Disjoint rooted spanning trees with small depths in de Bruijn and Kautz graphs. SIAM J. Comput. 1997, 26, 79-92
• HUCK, A. Independent trees in graphs. Graphs and Combin. 1994, 10, 29-45

Terms in the title (2)： 平面グラフ ,  全域木