Matching transformation graphs of cubic bipartite plane graphs (Q1868835)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1901887
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matching transformation graphs of cubic bipartite plane graphs |
scientific article; zbMATH DE number 1901887 |
Statements
Matching transformation graphs of cubic bipartite plane graphs (English)
0 references
28 April 2003
0 references
If \(M\) is any perfect matching of a connected cubic bipartite plane graph \(G\), then the authors prove that \(G\) has at least two disjoint \(M\)-alternating faces. This result is best possible in the sense that there are such graphs which do not have three disjoint \(M\)-alternating faces for some perfect matching \(M\). In addition, the authors show that the matching transformation graph of a connected cubic bipartite plane graph is 2-connected.
0 references
matching
0 references
cubic graphs
0 references
plane graphs
0 references
bipartite graphs
0 references
connectivity
0 references
0 references
0.8940597
0 references
0.8937875
0 references
0.8909019
0 references
0.88674545
0 references
0.88674545
0 references
0.8824363
0 references
