Premium
Separation of graphs into three components by the removal of edges
Author(s) -
Goldsmith Donald L.,
Manvel Bennet,
Faber Vance
Publication year - 1980
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/jgt.3190040209
Subject(s) - mathematics , combinatorics , graph , connected component
Several ways to separate a connected graph into three components by the removal of edges are discussed. Graphical parameters that count the number of edges removed are introduced and the relations between these parameters are given.