Art
J-GLOBAL ID：201602296069838068
Reference number：16A0456224
グラフに含まれる誘導マッチングの列挙
Author (4)：
,
,
,
Material：
Volume：
2016
Issue：
AL-157
Page：
VOL.2016-AL-157,NO.10 (WEB ONLY)
Publication year：
Feb. 28, 2016
JST Material Number：
U0451A
Document type：
Proceedings
Article type：
原著論文
Country of issue：
Japan (JPN)
Language：
JAPANESE (JA)
Thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,
,
,
Semi thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,
,
JST classification (1)：
JST classification
Category name(code) classified by JST.
Basics of graph theory
Reference (10)：
-
Cameron, K.: Induced matchings, Discrete Applied Mathematics, Vol. 24, No. 1-3, pp. 97-102 (online), DOI: 10.1016/0166-218X(92)90275-F (1989).
-
Diestel, R.: Graph Theory, 4th (2010).
-
Faudree, R. J., Gy?rf?s, A., Schelp, R. H. and Tuza, Z.: Induced matchings in bipartite graphs, Discrete Mathematics, Vol. 78, No. 1-2, pp. 83-87 (1989).
-
Garey, M. R. and Johnson, D. S.: Computers and intractability, Vol. 29, wh freeman New York (2002).
-
Henning, M. A. and Rautenbach, D.: Induced matchings in subcubic graphs without short cycles, Discrete Mathematics, Vol. 315, pp. 165-172 (2014).
ｍore...
Terms in the title (3)：
Terms in the title
Keywords automatically extracted from the title.
,
,
Return to Previous Page
