Premium
On decomposing a graph into nontrivial bonds
Author(s) -
McGuinness Sean
Publication year - 2000
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/1097-0118(200010)35:2<109::aid-jgt5>3.0.co;2-8
Subject(s) - combinatorics , mathematics , bipartite graph , edge transitive graph , discrete mathematics , graph minor , graph , disjoint sets , partition (number theory) , voltage graph , line graph
We show that for every 2‐connected bipartite graph which is not a multiple edge and which has no K 5 ‐minor there is an edge‐disjoint collection of nontrivial bonds (i.e., not stars) which partition the edges of the graph. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 109–127, 2000