Graph Decompositions

Graph decomposition is a method in graph theory that partitions a graph into a collection of subgraphs or edge-disjoint substructures according to specific structural or connectivity constraints, enabling the analysis of complex networks through simpler, constituent components.

1.1K

Publications

70.8K

Citations

1.9K

Authors

788

Institutions

Publications per year

2017–2026

171

Variants

Graph Decomposition

Authors

1.9K

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    10 publications · 4.7K citations

    10

    h-index

  2. XL
    Xuemin Lin

    UNSW Sydney, Australia

    10 publications · 562 citations

    10

    h-index

  3. DB
    Darryn Bryant

    The University of Queensland, Australia

    10 publications · 355 citations

    10

    h-index

  4. LQ
    Lu Qin

    University of Technology Sydney, Australia

    8 publications · 514 citations

    8

    h-index

  5. CA
    C. A. Rodger

    Auburn University, United States

    8 publications · 139 citations

    8

    h-index

1–5 of 1.9K

Venues

  1. Journal of Graph Theory

    52 publications · 1.7K citations

    27

    h-index

  2. Discrete Mathematics

    79 publications · 2.3K citations

    24

    h-index

  3. Journal of Combinatorial Theory Series B

    50 publications · 2.1K citations

    23

    h-index

  4. Discrete Applied Mathematics

    38 publications · 1.1K citations

    21

    h-index

  5. SIAM Journal on Discrete Mathematics

    28 publications · 1.1K citations

    19

    h-index

1–5