Induction On Graphs

Induction On Graphs is a graph-theoretic proof technique that extends mathematical induction to discrete structures by establishing a base case on a minimal graph and inductively extending the result to larger graphs through the addition of vertices or edges.

38

Publications

4.6K

Citations

71

Authors

39

Institutions

Publications per year

2017–2026

1

Authors

71

  1. HM
    Hiroshi Motoda

    The University of Osaka, Japan

    3 publications · 122 citations

    3

    h-index

  2. TN
    Tim Niblett

    Turing Institute, United Kingdom

    2 publications · 3K citations

    2

    h-index

  3. TW
    Takashi Washio

    The University of Osaka, Japan

    2 publications · 36 citations

    2

    h-index

  4. JH
    James Hirst

    AgroParisTech, France

    2 publications · 79 citations

    2

    h-index

  5. TM
    Takashi Matsuda

    Nagoya University, Japan

    2 publications · 36 citations

    2

    h-index

1–5 of 71

Venues

  1. Journal of Graph Theory

    4 publications · 140 citations

    4

    h-index

  2. Theoretical Computer Science

    3 publications · 44 citations

    3

    h-index

  3. Machine Learning

    2 publications · 3K citations

    2

    h-index

  4. Journal of Combinatorial Theory Series B

    2 publications · 108 citations

    2

    h-index

  5. 1

    h-index

1–5