Bipartizing matchings and Sabidussi's compatibility conjecture (Q1349078)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bipartizing matchings and Sabidussi's compatibility conjecture |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bipartizing matchings and Sabidussi's compatibility conjecture |
scientific article |
Statements
Bipartizing matchings and Sabidussi's compatibility conjecture (English)
0 references
21 May 2002
0 references
In a cubic graph \(G\), with dominating cycle \(C\), a matching \(M\) is called bipartizing if \(M \cap E(C) = \emptyset\), \(M\) covers all of \(V(G)-V(C)\), and \(G-M\) is homeomorphic to a cubic bipartite graph. The author shows that if \(G\) has two disjoint bipartizing matchings, then \(G\) has a cycle double cover \(S\) with \(C \in S\).
0 references
cycle double cover
0 references
compatible
0 references
Eulerian graph
0 references
