GENERATION OF DIRECTED TREES AND 2-TREES WITHOUT DUPLICATION

被引:3
作者
PAUL, AJ
机构
来源
IEEE TRANSACTIONS ON CIRCUIT THEORY | 1967年 / CT14卷 / 03期
关键词
D O I
10.1109/TCT.1967.1082724
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
引用
收藏
页码:354 / &
相关论文
共 50 条
[41]   Drawing Partial 2-Trees with Few Slopes [J].
Lenhart, William ;
Liotta, Giuseppe ;
Mondal, Debajyoti ;
Nishat, Rahnuma Islam .
ALGORITHMICA, 2023, 85 (05) :1156-1175
[42]   Drawing Partial 2-Trees with Few Slopes [J].
William Lenhart ;
Giuseppe Liotta ;
Debajyoti Mondal ;
Rahnuma Islam Nishat .
Algorithmica, 2023, 85 :1156-1175
[43]   Hadwiger's conjecture for squares of 2-trees [J].
Chandran, L. Sunil ;
Issac, Davis ;
Zhou, Sanming .
EUROPEAN JOURNAL OF COMBINATORICS, 2019, 76 :159-174
[44]   Testing Upward Planarity of Partial 2-Trees [J].
Chaplick, Steven ;
Di Giacomo, Emilio ;
Frati, Fabrizio ;
Ganian, Robert ;
Raftopoulou, Chrysanthi N. ;
Simonov, Kirill .
GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2022, 2023, 13764 :175-187
[45]   NUMBER OF PLANE 2-TREES - PRELIMINARY REPORT [J].
PALMER, EM ;
READ, RC .
NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1972, 19 (01) :A34-&
[46]   Resistance distance in straight linear 2-trees [J].
Barrett, Wayne ;
Evans, Emily J. ;
Francis, Amanda E. .
DISCRETE APPLIED MATHEMATICS, 2019, 258 :13-34
[47]   An efficient parallel strategy for computing K-terminal reliability and finding most vital edges in 2-trees and partial 2-trees [J].
Ho, CW ;
Hsieh, SY ;
Chen, GH .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1998, 51 (02) :89-113
[48]   An efficient parallel strategy for computing K-terminal reliability and finding most vital edge in 2-trees and partial 2-trees [J].
Ho, CW ;
Hsieh, SY ;
Chen, GH .
11TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM, PROCEEDINGS, 1997, :603-607
[49]   On some relations between 2-trees and tree metrics [J].
Leclerc, B ;
Makarenkov, V .
DISCRETE MATHEMATICS, 1998, 192 (1-3) :223-249
[50]   2-trees: Structural insights and the study of Hamiltonian paths [J].
Renjith, P. ;
Sadagopan, N. .
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2023, 15 (04)