Premium
Dividing a graph by degrees
Author(s) -
Anstee R. P.
Publication year - 1996
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199612)23:4<377::aid-jgt7>3.0.co;2-o
Subject(s) - combinatorics , mathematics , graph , integer (computer science) , graph factorization , decomposition , discrete mathematics , graph power , line graph , computer science , chemistry , programming language , organic chemistry
For a general graph G and integer k , the paper proves the existence of a decomposition of G into k ${1\over k}G$ G subgraphs whose degrees are close to ${1\over k}$ of the corresponding degrees in G and each subgraph has approximately ${1\over k}\mid E(G)\mid$ edges. © 1996 John Wiley & Sons, Inc.