Graph decompositions without isolated vertices II

Hikoe ENOMOTO; Shinsuke MATSUNAGA

doi:10.2969/jmsj/04910161

Hikoe ENOMOTO, Shinsuke MATSUNAGA

著者情報

ジャーナルフリー

1997 年 49 巻 1 号 p. 161-180

DOI https://doi.org/10.2969/jmsj/04910161

詳細

Published: 1997 Received: 1994/09/01 Available on J-STAGE: 2006/10/20 Accepted: - Advance online publication: - Revised: -
訂正情報
訂正日: 2006/10/20 訂正理由: - 訂正箇所: 引用文献情報訂正内容: Wrong : 1) J. A. Bondy and U.S.R. Murty, Graph Theory with Applications, North-Holland, 1984.
2) G. Chartrand and L. Lesniak, Graphs & Digraphs, 2nd ed., Wadsworth & Brooks/Cole Math. Ser., 1986.
3) Y. Egawa, personal communications.
4) H. Enomoto, Graph decompositions without isolated vertices, J. Combin. Theory Ser. B, 63 (1995), 111-124.
5) H. Enomoto, A. Kaneko and Zs. Tuza, P₃-factors and covering cycles in graphs of minimum degree n/3, Colloq. Math. Soc. János Bolyai, 52 (1987), 213-220.
6) H. Enomoto and S. Matsunaga, Graph decompositions without isolated vertices III, to appear in J. Graph Theory.
7) A. Frank, The Fifth British Combinatorial Conference, Aberdeen, Scotland, 1975.
8) E. Györi, On division of graphs to connected subgraphs, Colloq. Math. Soc. János Bolyai, 18 (1978), 485-494.
9) L. Lovász, A homology theory for spanning trees of a graph, Acta Math. Acad. Sci. Hungar., 30 (1977), 241-251.
10) S. B. Maurer, The Fifth British Combinatorial Conference, Aberdeen, Scotland, 1975.

Right : [1] J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North-Holland, 1984.
[2] G. Chartrand and L. Lesniak, Graphs & Digraphs, 2nd ed., Wadsworth & Brooks/Cole Math. Ser., 1986.
[3] Y. Egawa, personal communications.
[4] H. Enomoto, Graph decompositions without isolated vertices, J. Combin. Theory Ser. B, 63 (1995), 111-124.
[5] H. Enomoto, A. Kaneko and Zs. Tuza, P₃-factors and covering cycles in graphs of minimum degree n/3, Colloq. Math. Soc. János Bolyai, 52 (1987), 213-220.
[6] H. Enomoto and S. Matsunaga, Graph decompositions without isolated vertices III, to appear in J. Graph Theory.
[7] A. Frank, The Fifth British Combinatorial Conference, Aberdeen, Scotland, 1975.
[8] E. Györi, On division of graphs to connected subgraphs, Colloq. Math. Soc. János Bolyai, 18 (1978), 485-494.
[9] L. Lovász, A homology theory for spanning trees of a graph, Acta Math. Acad. Sci. Hungar., 30 (1977), 241-251.
[10] S. B. Maurer, The Fifth British Combinatorial Conference, Aberdeen, Scotland, 1975.

訂正日: 2006/10/20 訂正理由: - 訂正箇所: PDFファイル訂正内容: -

責任著者(Corresponding author)

訂正情報

J-STAGEへの登録はこちら（無料）