• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Fundamental and application oriented studies of discrete structures

Research Project

Project/Area Number 14540105
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field General mathematics (including Probability theory/Statistical mathematics)
Research InstitutionThe University of Electro-Communications

Principal Investigator

ANDO Kiyoshi  The University of Electro-Communications, Faculty of Electro-Communications, Professor, 電気通信学部, 教授 (20096944)

Co-Investigator(Kenkyū-buntansha) ISHIGAMI Yoshiyasu  The University of Electro-Communications, Faculty of Electro-Communications, Associate Professor, 電気通信学部, 助教授 (50262374)
KAWARABAYASHI Ken-ichi  Tohoku University, Graduate School of Information Science, Research Associate, 大学院・情報科学研究科, 助手 (40361159)
金子 篤司  工学院大学, 工学部, 助教授 (30255608)
Project Period (FY) 2002 – 2004
Project Status Completed (Fiscal Year 2004)
Budget Amount *help
¥3,500,000 (Direct Cost: ¥3,500,000)
Fiscal Year 2004: ¥1,400,000 (Direct Cost: ¥1,400,000)
Fiscal Year 2003: ¥1,000,000 (Direct Cost: ¥1,000,000)
Fiscal Year 2002: ¥1,100,000 (Direct Cost: ¥1,100,000)
Keywordsgraph theory / discrete optimization / algorithm / computational geometry / discrete geometry / combinatorial geometry / combinatorics / extremal graph theory
Research Abstract

From an arrangement of points on the plane, we construct a tree joining points by straight line segments, then We call the resulting tree a geometric tree of the arrangement of points. We gave an upper bound on the crossing number of three geometric trees in terms of n each vertex set of which is the subset of each color points sets of a given arrangement of n points with three colors.
For a vertex x of a tree, the number of leafs adjacent with x is called the leaf degree of x. We gave a necessary and sufficient condition for a connected graph to have a spanning tree whose maximum leaf degree is not exceed a given number.
We showed that if both a graph and its complement are contraction critically κ-connected, then the square of its order is not exceed κ^3, also we showed the sharpness of this bound.
An edge e of a 5-connected graph is called trivially noncontractible if there is a vertex of degree 5 which is adjacent, with both end vertices of e. We showed that a contraction critically 5-connected graph of order n has at least n/2 trivially noncontractible edges.
We proved that a 4-connected graph with m vertices of degree greater than 4 has at least m 4-contractible edges.

Report

(4 results)
  • 2004 Annual Research Report   Final Research Report Summary
  • 2003 Annual Research Report
  • 2002 Annual Research Report
  • Research Products

    (87 results)

All 2005 2004 2003 2002 Other

All Journal Article (66 results) Publications (21 results)

  • [Journal Article] Detecting even holes2005

    • Author(s)
      M.Chudnovsky, K.Kawarabayashi, P.Seymour
    • Journal Title

      J.Graph Theory 48

      Pages: 85-111

    • Related Report
      2004 Annual Research Report
  • [Journal Article] Rooted minor problems in highly connected graphs2004

    • Author(s)
      K.Kawarabayashi
    • Journal Title

      Discrete Math. 287

      Pages: 121-123

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Annual Research Report 2004 Final Research Report Summary
  • [Journal Article] A theorem on paths in locally planar triangulations2004

    • Author(s)
      K.Kawarabayashi
    • Journal Title

      European J.Combin. 25

      Pages: 781-784

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Annual Research Report 2004 Final Research Report Summary
  • [Journal Article] Vertex-disjoint cycles containing specified vertices in a bipartite graph2004

    • Author(s)
      G.Chen, H.Enomoto, K.Kawarabayashi, K.Ota, D.Lou, A.Saito
    • Journal Title

      J.Graph Theory 46

      Pages: 145-166

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Annual Research Report 2004 Final Research Report Summary
  • [Journal Article] Cycled through a prescribed vertex set in N-connected graphs2004

    • Author(s)
      K.Kawarabayashi
    • Journal Title

      Combin. Theory Ser.B 90

      Pages: 315-323

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] k-linked graphs with girth condition2004

    • Author(s)
      K.Kawarabayashi
    • Journal Title

      J. Graph Theory 45,no.1

      Pages: 48-50

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Rooted minor problems in highly connected graphs2004

    • Author(s)
      Kawarabayashi, Ken-ichi
    • Journal Title

      Discrete Math. 287

      Pages: 121-123

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] A theorem on paths in locally planar triangulations2004

    • Author(s)
      Kawarabayashi, Ken-ichi
    • Journal Title

      European J.Combin. 25

      Pages: 781-784

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Vertex-disjoint cycles containing specified vertices in a bipartite graph.2004

    • Author(s)
      Chen, Guantao, Enomoto, Hikoe, Kawarabayashi, Ken-ichi, Ota, Katsuhiro, Lou, Dingjun, Saito, Akira
    • Journal Title

      J.Graph Theory 46, no.3

      Pages: 145-165

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Cycles through a prescribed vertex set in N connected graphs.2004

    • Author(s)
      Kawarabayashi, Ken-ichi
    • Journal Title

      J.Combin.Theory Ser.B 90, no.2

      Pages: 315-323

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] κ-linked graphs with girth condition.2004

    • Author(s)
      Kawarabayashi, Ken-ichi
    • Journal Title

      J.Graph Theory 45, no.1

      Pages: 48-50

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Cycles through a prescribed vertex set in N-connected graphs2004

    • Author(s)
      K.Kawarabayashi
    • Journal Title

      Combin.Theory Ser.B 90

      Pages: 315-323

    • Related Report
      2004 Annual Research Report
  • [Journal Article] Vertices of degree 6 in a contraction critically 6-connected graph2003

    • Author(s)
      K.Ando, A.Kaneko, K.Kawarabayashi
    • Journal Title

      Discrete Math. 273 no.1-3

      Pages: 55-69

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Some forbidden subgraph conditions for a graph to have a k-contractible edge2003

    • Author(s)
      K.Ando, K.Kawarabayahsi
    • Journal Title

      Discrete Math. 267 no.1-3

      Pages: 3-11

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Cycles having the same modularity and removable edges in 2-connected graphs2003

    • Author(s)
      K.Ando, M.Hagita, A.Kaneko, M.Kano, K.Kawarabayashi, A.Saito
    • Journal Title

      Discrete Math. 265 no.1-3

      Pages: 23-30

    • NAID

      40005603562

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Maximum number of edges in a critically k-connected graph2003

    • Author(s)
      K.Ando, Y.Egawa
    • Journal Title

      Discrete Math. 260 no.1-3

      Pages: 1-25

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Vertex-disjoint cycles eontaining prescribed vertices2003

    • Author(s)
      Y.Ishigami, T.Jiang
    • Journal Title

      J.Graph Theory 42,no.4

      Pages: 276-296

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Subgraphs of graphs on surfaces with high-representativity2003

    • Author(s)
      K.Kawarabayashi, A.Nakamoto, K.Ota
    • Journal Title

      J.Combin. Theory Ser.B 89,no.2

      Pages: 207-229

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] On two equimatchable graph classes2003

    • Author(s)
      K.Kawarabayashi, M.Plummer, A.Saito
    • Journal Title

      Discrete Math. 266,no.1-3

      Pages: 263-274

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] 2-connected 7-coverings of 3-connected graphs on surfaces2003

    • Author(s)
      K.Kawarabayashi, A.Nakamoto, K.Ota
    • Journal Title

      J.Graph Theory 43,no.1

      Pages: 26-36

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Vertices of degree 6 in a contraction critically 6-connected graph.2003

    • Author(s)
      Ando, Kiyoshi, Kaneko, Atsushi, Kawarabayashi, Ken-ichi
    • Journal Title

      Discrete Math. 273, no.1-3

      Pages: 55-69

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Some forbidden subgraph conditions for a graph to have a κ-contractible edge2003

    • Author(s)
      Ando, Kiyoshi, Kawarabayashi, Ken-ichi
    • Journal Title

      Discrete Math. 267, no.1-3

      Pages: 3-11

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Cycles having the same modularity and removable edges in 2-connected graphs.2003

    • Author(s)
      Ando, Kiyoshi, Hagita, Mariko, Kaneko, Atsushi, Kano, Mikio, Kawarabayashi, Ken-ichi, Saito, Akira
    • Journal Title

      Discrete Math. 265, no.1-3

      Pages: 23-30

    • NAID

      40005603562

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Maximum number of edges in a critically κ-connected graph.2003

    • Author(s)
      Ando, Kiyoshi, Egawa, Yoshimi
    • Journal Title

      Discrete Math. 260, no.1-3

      Pages: 1-25

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Vertex-disjoint cycles containing prescribed vertices.2003

    • Author(s)
      Ishigami, Yoshiyasu, Jiang, Tao
    • Journal Title

      J.Graph Theory 42, no.4

      Pages: 276-296

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Subgraphs of graphs on surfaces with high representativity.2003

    • Author(s)
      Kawarabayashi, Ken-ichi, Nakamoto, Atsuhiro, Ota, Katsuhiro
    • Journal Title

      J.Combin.Theory Ser.B 89, no.2

      Pages: 207-229

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] On two equimatchable graph classes.2003

    • Author(s)
      Kawarabayashi, Ken-ichi, Plummer, Michael D., Saito, Akira
    • Journal Title

      Discrete Math. 266, no.1-3

      Pages: 263-274

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] 2-connected 7-coverings of 3-connected graphs on surfaces.2003

    • Author(s)
      Kawarabayashi, Ken-ichi, Nakamoto, Atsuhiro, Ota, Katsuhiro
    • Journal Title

      J.Graph Theory 43, no.1

      Pages: 26-36

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Graph G for which both G and G are contraction critically k-connected2002

    • Author(s)
      J.Akiyama, K.Ando, Y.Egawa
    • Journal Title

      Graphs Combin. 18 no.4

      Pages: 693-708

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Self-complementary graphs with minimum degree two2002

    • Author(s)
      K.Ando, A.Nakamoto
    • Journal Title

      Ars Combin. 65

      Pages: 65-74

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Edge-wide-diameter of graphs with diameter d2002

    • Author(s)
      T.Kojima, K.Ando, A.Kaneko
    • Journal Title

      Ann Comb. 6 no.1

      Pages: 57-64

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Contractible edges and bowties in a k-connected graph2002

    • Author(s)
      K.Ando, A.Kaneko, K.Kawarabayashi, K.Yoshimoto
    • Journal Title

      Ars Combin. 64

      Pages: 239-247

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Bandwidth of the Cartesian product of two connected graphs2002

    • Author(s)
      T.Kojima, K.Ando
    • Journal Title

      Discrete Math. 252 no.1-3

      Pages: 227-235

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] On quadrangulations of closed surfaces covered by vertices of degree 32002

    • Author(s)
      K.Ando, A.Nakamoto
    • Journal Title

      Ars Combin. 62

      Pages: 121-127

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Almost-spanning subgraphs with bounded degree in dense graphs2002

    • Author(s)
      Y.Ishigami
    • Journal Title

      European J.Combin. 23,no.5

      Pages: 583-612

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] A common extension of the Erdos-Stone theorem and the Alon-Yuster theorem for unbounded graphs2002

    • Author(s)
      Y.Ishigami
    • Journal Title

      European J.Combin. 23,no.4

      Pages: 431-448

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Proof of a conjecture of Bollobas and Kohayakawa on the Erdos-Stone theorem2002

    • Author(s)
      Y.Ishigami
    • Journal Title

      J.Combin. Theory Ser.B 85,no.2

      Pages: 222-254

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] An extension of a theorem on cycles containing specified independent edges2002

    • Author(s)
      Y.Ishigami, H.Wang
    • Journal Title

      Discrete Math. 245,no.1-3

      Pages: 127-137

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] On a Hamiltonian cycle in which specified vertices are not isolated2002

    • Author(s)
      A.Kaneko, K.Kawarabayashi, K.Ota, K.Yoshimoto
    • Journal Title

      Discrete math. 258,no.1-3

      Pages: 85-91

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] On separable self-complementary graphs2002

    • Author(s)
      K.Kawarabayashi, A.Nakamoto, Y.Oda, K.Ota, S.Tazawa, M.Watanabe
    • Journal Title

      Discrete Math. 257,no.1

      Pages: 165-168

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Contractible edges and triangles in k-connected graphs2002

    • Author(s)
      K.Kawarabayashi
    • Journal Title

      J.Combin. Theory Ser.B 85,no.2

      Pages: 207-221

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Hamiltonian cycles in n-extendable graphs2002

    • Author(s)
      K.Kawarabayashi, K.Ota, A.Saito
    • Journal Title

      J. Graph Theory 40,no.2

      Pages: 75-82

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Graph partition into paths containing specified vertices2002

    • Author(s)
      K.Kawarabayashi
    • Journal Title

      Discrete Math. 248,no.1-3

      Pages: 271-277

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Path factors in cubic graphs2002

    • Author(s)
      K.Kawarabayashi, H.Matsuda, Y.Oda, K.Ota
    • Journal Title

      J. Graph Theory 39,no.3

      Pages: 188-193

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] F-factor and vertex-disjoint F in a graph2002

    • Author(s)
      K.Kawarabayashi
    • Journal Title

      Ars Combin. 62

      Pages: 183-187

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] K factor in a graph2002

    • Author(s)
      K.Kawarabayashi
    • Journal Title

      J. Graph Theory 39,no.2

      Pages: 111-128

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] One or two disjoint circuits cover independent edges. Lovasz-Woodall conjecture2002

    • Author(s)
      K.Kawarabayashi
    • Journal Title

      J.Combin. Theory Ser.B 84,no.1

      Pages: 1-44

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Graph G for which both G and G^^-are contraction critically κ-connected.2002

    • Author(s)
      Akiyama, Jin, Ando, Kiyoshi, Egawa, Yoshimi
    • Journal Title

      Graphs Combin. 18, no.4

      Pages: 693-708

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Self-complementary graphs with minimum degree two.2002

    • Author(s)
      Ando, Kiyoshi, Nakamoto, Atsuhiro
    • Journal Title

      Ars Combin. 65

      Pages: 65-74

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Edge-wide-diameter of graphs with diameter d.2002

    • Author(s)
      Kojima, Toru, Ando, Kiyoshi, Kaneko, Atsushi
    • Journal Title

      Ann.Comb. 6, no.1

      Pages: 57-64

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Contractible edges and bowties in a κ-connected graph.2002

    • Author(s)
      Ando, Kiyoshi, Kaneko, Atsushi, Kawarabayashi, Ken-ichi, Yoshiomoto, Kiyoshi
    • Journal Title

      Ars Combin. 64

      Pages: 239-247

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Bandwidth of the Cartesian product of two connected graphs.2002

    • Author(s)
      Kojima, Toru, Ando, Kiyoshi
    • Journal Title

      Discrete Math. 252, no.1-3

      Pages: 227-235

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] On quadrangulations of closed surfaces covered by vertices of degree 3.2002

    • Author(s)
      Ando, Kiyoshi, Nakamoto, Atsuhiro
    • Journal Title

      Ars Combin. 62

      Pages: 121-127

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Almost-spanning subgraphs with bounded degree in dense graphs.2002

    • Author(s)
      Ishigami, Yoshiyasu
    • Journal Title

      European J.Combin. 23, no.5

      Pages: 583-612

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] A common extension of the Erdos-Stone theorem and the Alon-Yuster theorem for unbounded graphs.2002

    • Author(s)
      Ishigami, Yoshiyasu
    • Journal Title

      European J.Combin. 23, no.4

      Pages: 431-448

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Proof of a conjecture of Bollobas and Kohayakawa on the Erdos-Stone theorem.2002

    • Author(s)
      Ishigami, Yoshiyasu
    • Journal Title

      J.Combin.Theory Ser.B 85, no.2

      Pages: 222-254

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] An extension of a theorem on cycles containing specified independent edges.2002

    • Author(s)
      Ishigami, Yoshiyas, Wang, Hong
    • Journal Title

      Discrete Math. 245, no.1-3

      Pages: 127-137

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] On a Hamiltonian cycle in which specified vertices are not isolated.2002

    • Author(s)
      Kaneko, Atsushi, Kawarabayashi, Ken-ichi, Ota, Katsuhiro, Yoshimoto, Kiyoshi
    • Journal Title

      Discrete Math. 258, no.1-3

      Pages: 85-91

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] On separable self-complementary graphs.2002

    • Author(s)
      Kawarabayashi, Ken-ichi, Nakamoto, Atsuhiro, Oda, Yoshiaki, Ota, Katsuhiro, Tazawa, Shinsei, Watanabe, Mamoru
    • Journal Title

      Discrete Math. 257, no.1

      Pages: 165-168

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Contractible edges and triangles in k-connected graphs.2002

    • Author(s)
      Kawarabayashi, Ken-ichi
    • Journal Title

      J.Combin.Theory Ser.B 85, no.2

      Pages: 207-221

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Hamiltonian cycles in n-extendable graphs.2002

    • Author(s)
      Kawarabayashi, Ken-ichi, Ota, Katsuhiro, Saito, Akira
    • Journal Title

      J.Graph Theory 40, no.2

      Pages: 75-82

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Graph partition into paths containing specified vertices.2002

    • Author(s)
      Kawarabayashi, Ken-ichi
    • Journal Title

      Discrete Math. 248, no.1-3

      Pages: 271-277

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Path factors in cubic graphs.2002

    • Author(s)
      Kawarabayashi, Ken-ichi, Matsuda, Haruhide, Oda, Yoshiaki, Ota, Katsuhiro
    • Journal Title

      J.Graph Theory 39, no.3

      Pages: 188-193

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] F-factor and vertex-disjoint F in a graph.2002

    • Author(s)
      Kawarabayashi, Ken-ichi
    • Journal Title

      Ars Combin. 62

      Pages: 183-187

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] K^-_4 -facter in a graph.2002

    • Author(s)
      Kawarabayashi, Ken-ichi
    • Journal Title

      J.Graph Theory 39, no.2

      Pages: 111-128

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] One or two disjoint circuits cover independent edges. Lovasz-Woodall conjecture.2002

    • Author(s)
      Kawarabayashi, Ken-ichi
    • Journal Title

      J.Combin.Theory Ser.B 84, no.1

      Pages: 1-44

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Publications] K.Ando, K.Kawarabayashi: "Some forbidden subgraph conditions for a graph to have a κ-contractible edge"Discrete Math.. 267. 3-11 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] K.Ando, M.Hagita, A.kaneko, M.Kano, K.Kawarabayashi, A.Saito: "Cycles having the same modularity and removable edges in 2-connected graphs"Discrete Math.. 265. 23-30 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] A.Kaneko, K.Yoshimoto: "A 2-factor with two components of a graph satisfying the Chvtal-Erdos condition"J.Graph Theory. 43. 269-279 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] A.Kaneko: "A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two"J.Combin.Thoery Ser.B. 88. 195-218 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] M.Hagita, A.Kaneko, M.Kano, K.Kawarabayashi, A.Saito: "On geometric independency trees for points in the plane"Discrete Math.. 265. 23-30 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] A.Kaneko, K.Kawarabayashi, K.Ota, K.Yoshiomoto: "On geometric independency trees for points in the plane"Discrete Math.. 258. 85-91 (2002)

    • Related Report
      2003 Annual Research Report
  • [Publications] Y.Ishigami, T.Jiang: "Vertex-disjoint cycles containing prescribed vertices"J.Graph Theory. 42. 276-296 (2002)

    • Related Report
      2003 Annual Research Report
  • [Publications] K.Ando, Y.Egawa: "Maximum number of edges in a critically k-connected graph"Discrete Math.. 260. 1-25 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] K.Ando, A.Nakamoto: "Self-complementary graphs with minimum degree two"Ars Combin.. 65. 65-74 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] T.Kojima, K.Ando, A.Kaneko: "Edge-wide-diameter of graphs with diameter d"Ann. Comb.. 6. 57-64 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] K.Ando, A.Nakamoto: "On quadrangulations of closed surfaces covered by vertices of degree 3"Ars Combin.. 62. 121-127 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] T.Kojima, K.Ando: "Bandwidth of the Cartesian product of two connected graphs"Discrete Math.. 252. 227-235 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] K.Ando, A.Kaneko, K.Kawarabayashi, K.Yoshimoto: "Contractible edges and bowties in a k-connected graph"Ars Combin.. 64. 239-247 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] K.Ando, Y.Egawa, A.Kaneko, K.Kawarabayashi, H.Matsuda: "Path factors in claw-free graphs"Discrete Math.. 243. 195-200 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] A.Kaneko, K.Yoshimoto: "On a 2-factor with a specified edge in a graph satisfying the Ore condition"Discrete Math.. 257. 445-461 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] A.Kaneko, M.Kano: "Perfect partitions of convex sets in the plane"Discrete Comput. Geom.. 28. 211-222 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] Y.Ishigami: "Almost-spanning subgraphs with bounded degree in dense graphs"European J. Combin.. 23. 583-612 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] Y.Ishigami, H.Wang: "Proof of a conjecture of Bollobos and Kohayakawa on the Erdos-Stone theorem"Combin. Theory Ser. B. 85. 222-254 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] Y.Ishigami: "Proof of a conjecture of Bollobos and Kohayakawa on the Erdos-Stone theorem"J. of Comb. Theory Ser. B. 85. 222-254 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] Y.Ishigami: "A common extension of the Erdos-Stone theorem and the Alon-Yuster theorem for unbouded graphs"European J. Combin.. 23. 431-448 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] Y.Ishigami, H.Wang: "An extension of a theorem on cycles containing specified independent edges"Discrete Math.. 245. 127-137 (2002)

    • Related Report
      2002 Annual Research Report

URL: 

Published: 2002-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi