Premium
Two trees in maximal planar bipartite graphs
Author(s) -
Ringel Gerhard
Publication year - 1993
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.3190170610
Subject(s) - mathematics , combinatorics , bipartite graph , planar graph , planar , discrete mathematics , chordal graph , graph , computer science , computer graphics (images)
It is proven that each maximal planar bipartite graph is decomposable into two trees. © 1993 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom