COUNTING LABELED CHORDAL GRAPHS

被引：21
作者：
WORMALD, NC [1 ]
机构：
[1] UNIV AUCKLAND,DEPT MATH,AUCKLAND,NEW ZEALAND
来源：
GRAPHS AND COMBINATORICS | 1985年 / 1卷 / 02期
关键词：
D O I：
10.1007/BF02582944
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：193 / 200
页数：8
相关论文
共 8 条
  • [1] ALMOST ALL CHORDAL GRAPHS SPLIT
    BENDER, EA
    RICHMOND, LB
    WORMALD, NC
    [J]. JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS, 1985, 38 (APR): : 214 - 221
  • [2] BOOTH KS, 1982, SIAM J COMPUT, V11, P189
  • [3] Dirac Gabriel Andrew, 1961, ABH MATH SEM HAMBURG, V25, P71, DOI [DOI 10.1007/BF02992776, 10.1007/BF02992776]
  • [4] COUNTING INTERVAL-GRAPHS
    HANLON, P
    [J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1982, 272 (02) : 383 - 426
  • [5] Harary F., 1973, GRAPHICAL ENUMERATIO
  • [6] Harary F., 1969, GRAPH THEORY, DOI DOI 10.1201/9780429493768
  • [7] Robinson R. W., 1970, Journal of Combinatorial Theory, Series A, V9, P327, DOI 10.1016/S0021-9800(70)80089-8
  • [8] Tutte W.T, 1966, CONNECTIVITY GRAPHS
1