Planar wheel-like bricks
111 The research
is partially supported by NSFC (No. 12271235) and NSF of Fujian Province (No. 2021J06029).
E-mail addresses: [email protected] (F. Lu), [email protected] (J. Xue)
Abstract
An edge in a matching covered graph is removable if is matching covered; a pair of edges of is a removable doubleton if is matching covered, but neither nor is. Removable edges and removable doubletons are called removable classes, which was introduced by Lovász and Plummer in connection with ear decompositions of matching covered graphs. A brick is a nonbipartite matching covered graph without nontrivial tight cuts. A brick is wheel-like if has a vertex , such that every removable class of has an edge incident with . Lucchesi and Murty conjectured that every planar wheel-like brick is an odd wheel. We present a proof of this conjecture in this paper.
Keywords: wheel-like bricks; perfect matchings; removable classes
1 Introduction
Graphs considered in this paper are finite and loopless (multiple edges are allowed, where an edge of a graph is a multiple edge if there are at least two edges of with the same ends as ). We follow [1] and [10] for undefined notations and terminologies. Let be a graph with the vertex set and the edge set . For , by , or simply , we mean the set of edges of with one end vertex in and the other end vertex in . We shall simply write for if and . Let be an edge cut of , where . (If is understood, the subscript is omitted.) If , then we denote , for brevity, by or . An edge cut is trivial if or .
Let be a graph with a perfect matching. An edge in is forbidden if does not lie in any perfect matching of . A connected nontrivial graph is matching covered if each of its edges is not forbidden. We denote by the graph obtained from by contracting to a single vertex , for brevity, by . The graphs and are the two -contractions of . An edge cut is separating if both -contractions of are matching covered, and is tight if every perfect matching contains exactly one edge of . A matching covered nonbipartite graph is a brick if every tight cut is trivial, is solid if every separating cut is a tight cut. Bricks are 3-connected and bicritical [6], where a nontrivial graph is bicritical if has a perfect matching for any two vertices and of .
Lovász [9] proved that any matching covered graph can be decomposed into a unique list of bricks and braces (a matching covered bipartite graph in which every tight cut is trivial) by a procedure called the tight cut decomposition. In particular, any two decompositions of a matching covered graph yield the same number of bricks; this number is denoted by . A near-brick is a matching covered graph with . Obviously, a brick is a near-brick.
We say that an edge in a matching covered graph is removable if is matching covered. A pair of edges of a matching covered graph is a removable doubleton if is matching covered, but neither nor is. Removable edges and removable doubletons are called removable classes.
Lovász [8] proved that every brick distinct from and (see Figure 1 (left)) has a removable edge. Improving Lovász’s result, Carvalho et al. obtained a lower bound of removable classes of a brick in terms of the maximum degree.
Theorem 1.1 ([2]).
Every brick has at least removable classes, where is the maximum of the degrees of vertices in .
In [13] and [14], Zhai et al., and Zhai and Guo presented lower bounds of the number of removable edges (ears) in a matching covered graph in terms of the number of the perfect matchings needed to cover all edges of and the edge-chromatic number, respectively. Wu et al. [12] showed every claw-free brick with more than 6 vertices has at least removable edges. Wang et al. [11] obtained the number of removable edges of Halin graphs with even number of vertices, other than , and (see Figure 1 (right)), is at least . Generally, Lucchesi and Murty [7] conjectured that there exist a positive real number and an integer such that any brick of order at least has removable edges.
For an integer , the wheel is the graph obtained from a cycle of length by adding a new vertex and joining it to all vertices of . The cycle is the rim of , the vertex is its hub. Obviously, every wheel is planar. A wheel is odd if is odd. The graph (a complete graph with 4 vertices) is an odd wheel that every edge lies in a removable doubleton. For an odd wheel other than , it can be checked every edge on the rim is not removable, and every edge incident with the hub is removable (for example, see Exercise 2.2.4 in [7]). More generally, we say a brick is wheel-like if has a vertex , called its hub, such that every removable class of has an edge in . Lucchesi and Murty made the following conjecture.
Conjecture 1.2 ([7]).
Every planar wheel-like brick is an odd wheel.
We present a proof of this conjecture. The following is the main result.
Theorem 1.3.
Every planar wheel-like brick is an odd wheel and all multiple edges of are incident with the hub.
2 Preliminaries
We begin with some notations. For a vertex set , denote by the subgraph induced by , by , or simply when , the set of all vertices in adjacent to vertices in . Let . Let be a graph with a perfect matching. A nonempty vertex set of is a barrier of if , where is the number of components with odd number of vertices of . Tutte proved the following theorem which characterizes graphs that have a perfect matching in 1947.
Theorem 2.1 (Tutte).
A graph has a perfect matching if and only if , for every .
The following result can be obtained by Theorem 2.1.
Lemma 2.2 ([5]).
Assume that is a graph with a perfect matching. An edge is forbidden if and only if there exists a barrier containing and .
Let and be two vertex-disjoint graphs and let and be vertices of and , respectively, such that . Moreover, let be a given bijection between and . We denote by the graph obtained from the union of and by joining, for each edge in , the end of in belonging to to the end of in belonging to ; and refer to as the graph obtained by splicing (at ), with (at ), with respect to the bijection , for brevity, to . In general, the graph resulting from splicing two graphs and depends on the choice of , and . The following proposition can be gotten by the definition of matching covered graphs directly (see Theorem 2.13 in [7] for example).
Proposition 2.3.
The splicing of two matching covered graphs is also matching covered.
By Proposition 2.3, is a matching covered graph if and are matching covered. Let . Then the two -contractions of are and , respectively. Therefore, the edge cut is separating in . A matching covered graph is near-bipartite if it has a removable doubleton such that the subgraph obtained by the deletion of is a (matching covered) bipartite graph. In fact, every brick with a removable doubleton is near-bipartite [9]. So, if is a removable doubleton of a brick , then both ends of lie in one color class of , and both ends of lie in the other color class. Clearly, any two pairs of removable classes in a brick are disjoint. The following theorem is about removable edges of a near-bipartite brick.
Theorem 2.4 (Theorem 9.17 in [7]).
Every simple near-bipartite brick, distinct from , and , has two nonadjacent removable edges.
Let be a matching covered graph. A separating cut of is a robust cut if is not tight and both -contractions of are near-bricks.
Theorem 2.5 ([3]).
Every nonsolid brick has a robust cut.
Theorem 2.6 ([3]).
Let be a brick and be a robust cut of . Then, there exists a subset of and a superset of such that and are bricks and the graph , obtained from by contracting and to single vertices and , respectively, is bipartite and matching covered, where and lie in different color classes of .
As a type of (solid) bricks, odd wheels play a crucial role in our proof.
Proposition 2.7 ([4]).
Let be a simple brick on six vertices. Then is either nonsolid or the 5-wheel .
Theorem 2.8 ([4]).
Every simple planar solid brick is an odd wheel.
Let be a separating cut of matching covered graph and . If , we also say is removable in . The following results are about the removable edges in -contractions.
Lemma 2.9 (Corollary 8.9 in [7]).
Let be a matching covered graph, and let be a separating cut of . If an edge is removable in both -contractions of , then is removable in .
Theorem 2.10 (Lemma 3.1 in [3]).
Let be a separating but not tight cut of a matching covered graph and let . Assume that is a brick, and let be a removable doubleton of . If or if the edge of is removable in then contains an edge which is removable in .
Lemma 2.11.
Assume that is a brick, and is an edge cut of such that both and are brick. If , and and are removable doubletons of and , respectively, then is a removable doubleton of .
Proof.
Obviously, . Let and . As , . Then is isomorphic to . By the definition of removable doubletons, and are matching covered bipartite graphs. Therefore, is matching covered by Proposition 2.3. Assume that and are the two color classes of such that both ends of lie in for . Then is a bipartite graph with two color classes: and . Note that . So is bipartite. And then it is matching covered by Theorem 4.1.1 in [10]. As two ends of lie in , and two ends of lie in , and are not matching covered by a simple computation. Therefore, the result follows. ∎
For nonremovable edges in a bipartite graph, we have the following result.
Lemma 2.12 (Lemma 8.2 in [7]).
Let be a bipartite matching covered graph with and as its color classes, and .
An edge of , with and , is not removable in if and only if there exist nonempty proper subsets and of and , respectively, such that:
1) the subgraph is matching covered, and
2) and , and .
3 Lemmas
In this section, we will present some useful lemmas.
Proposition 3.1.
Let be a matching covered graph. Assume that and is a triangle. Then is not removable.
Proof.
It can be checked that is a barrier of . By Lemma 2.2, is forbidden in . So the result holds. ∎
We say an edge in a matching covered graph satisfies the triangle condition if one end of is of degree 3, and lie in a triangle that does not contain . If satisfies the triangle condition, then is not removable by Proposition 3.1.
Proposition 3.2.
and are not wheel-like.
Proof.
As shown in Figure 1, is a removable doubleton for , and the bold edge is a removable edge. So the result follows. ∎


Lemma 3.3.
Let be a simple near-bipartite brick. Then is wheel-like if and only if is isomorphic to .
Proof.
We will need the following theorem about planar graphs.
Theorem 3.4 (Kuratowski’s Theorem).
Let be a graph. Then is nonplanar if and only if contains a subgraph that is a subdivision of either or .
Lemma 3.5.
Let be a planar brick and be a separating cut of . Then and are planar.
Proof.
Proposition 3.6.
Let be a simple planar brick with six vertices. Then is a wheel-like brick if and only if is .
Proof.
By Proposition 2.7, is either nonsolid or . As is wheel-like, we may assume that is a nonsolid brick. Then has a nontrivial separating cut . Since is 3-connected and both -contractions of are matching covered, both -contractions of are isomorphic to ’s (up to multiple edges). It can be checked that is isomorphic to or one of the graphs in Figure 2. By Proposition 3.2, is not wheel-like. It can be seen that all the graphs in Figure 2 are not wheel-like (the bold edges are removable). Therefore, the result holds. ∎

When we turn to the graphs with multiple edges, we have the following proposition.
Proposition 3.7.
Let be a matching covered graph and . And let be obtained from by adding an edge to two ends of . Then and are removable in . Therefore, if is not wheel-like, then is not wheel-like.
Proof.
As and is matching covered, both and are removable in . Obviously, an edge that is removable in is removable in . If is a removable doubleton of , then every perfect matching of containing or contains . So and are forbidden in , that is, is not removable in . Therefore, if does not contain any vertex such that each removable class of has an edge in , neither does . ∎
Lemma 3.8.
Let be a wheel-like brick and is its hub. Then all the multiple edges are incident with .
Proof.
Assume that the underlying simple graph of is . If , the result holds obviously. So we assume that . If is near-bipartite, then is by Lemma 3.3. By Proposition 3.7, all the multiple edges of are incident with a common vertex. If is not near-bipartite, then every removable class of is a removable edge. By Theorem 1.1, is incident with at least three removable edges. By Proposition 3.7 again, every multiple edge is incident with . ∎
Lemma 3.9.
Assume that and are two disjoint bricks, and .
Let . If is a wheel-like brick, then the following statements hold.
1) At least one of and is wheel-like such that or is its hub.
2) If is wheel-like, is its hub, and every edge of lies in some removable class of , then is also wheel-like.
Proof.
1) By Theorem 1.1, and contain at least three removable classes, respectively. Suppose that and are removable classes of and , respectively, such that and . Then is a matching in . For , if is a removable edge, then is also a removable edge in by Lemma 2.9, and if is a removable doubleton, then one edge of is also removable in by Theorem 2.10. It means that contains two nonadjacent removable edges of , contradicting the fact that is wheel-like. So at least one of and is wheel-like, such that or is its hub.
2) Suppose, to the contrary, that is not a wheel-like brick. Let , and be removable classes of such that there does not exist any vertex in incident with one edge in , and , respectively. For , if , or and is removable in , then contains a removable edge in by Lemma 2.9 and Theorem 2.10; if , and is a removable doubleton in , then by Theorem 2.10, the edge is a removable edge in . (If , lies in a removable doubleton of , and lies in a removable doubleton in , then has a removable doubleton by Lemma 2.11, and so the underlying simple graph of is by Lemma 3.3, contradicting the assumption that is a splicing of two bricks.) So, in above both alternatives, for each (), we have a removable class of such that or . Therefore, there does not exist any vertex in incident with one edge in , and , respectively, contradicting the fact that is wheel-like. ∎
Lemma 3.10.
Let and be two odd wheels such that and , where and are the hubs of and , respectively. Assume that
, , and is a brick.
The graph is wheel-like if and only if the following statements hold.
1). . Without loss of generality, assume that , that is . Then .
2). All the multiple edges of and are incident with and , respectively.
3). Without loss of generality, assume that and , where . Then and .
Proof.
Assume that for (the subscript is modulo ), and for (the subscript is modulo ). Let and .
We will prove the sufficiency firstly. By Statement 2), every multiple edge is incident with the hub. Then . We will prove the edge in is nonremovable. As , that is and , we consider the following alternatives.
Case 1. .
Assume that (the case when is the same by symmetry). Let . Then has exactly three components: and , all of which are odd. Therefore, is a barrier of containing both ends of the edge . By Lemma 2.2, is nonremovable in . By symmetry, is also nonremovable in .
Assume that . It can be checked is a barrier of containing . So is nonremovable in . If , is a barrier of containing . So are nonremovable in . Every edge of satisfies the triangle condition, and then it is not removable by Proposition 3.1. If , then every edge in satisfies the triangle condition; so it is not removable by Proposition 3.1 again.
Now we assume that . If , it can be checked is a barrier of containing . So are nonremovable in . Every edge of satisfies the triangle condition, and then it is not removable by Proposition 3.1. If , then every edge of satisfies the triangle condition; so it is not removable by Proposition 3.1 once more.
Case 2. .
Without loss of generality, assume that (the case when is the same by symmetry). Let . Then has exactly three components: and , which are odd. Therefore, is a barrier of containing both ends of the edge . By Lemma 2.2, is nonremovable in . If , then every edge of satisfies the triangle condition; so it is not removable by Proposition 3.1. Then we consider the case when . It can be checked is a barrier of containing . So is nonremovable in . Note that every edge of satisfies the triangle condition, and then it is not removable by Proposition 3.1 again.
Case 3. .
If , it can be checked is a barrier of containing . So is nonremovable in . Note that every edge of satisfies the triangle condition, and then it is not removable by Proposition 3.1. If , then every edge of satisfies the triangle condition; so it is not removable by Proposition 3.1 again. Therefore, is wheel-like.
We now turn to the necessary. By Lemma 3.9, at least one of and is wheel-like such that or is its hub. Without loss of generality, assume that is wheel-like and (in fact, is an odd wheel). Since every edge in is a removable class in , is wheel-like by Lemma 3.9. By Lemma 3.8, every multiple edge of or is incident with the hubs, that is, Statement 2) holds. We will obtain a contradiction that is not wheel-like if it does not satisfy Statements 1)-3).
Case A. for .
Without loss of generality, assume that and . Assume that . As is a brick, it is 3-connected. Then . Otherwise, is 2-vertex cut in .
If , then the underlying simple graph of is isomorphic to or the first two graphs in Figure 2. By Proposition 3.2, is not wheel-like. Note that the first two graphs in Figure 2 are not wheel-like. So the underlying simple graph of is not wheel-like. Therefore, is not wheel-like by Proposition 3.7, a contradiction.
Next, we consider and . Since and every edge in is removable in , every edge in is removable in by Lemma 2.9. Without loss of generality, assume that . Then it can be checked that can be gotten from an odd wheel by inserting a vertex into two edges on the rim of the odd wheel, respectively, up to multiple edges (incident with the hub). So is matching covered, and then is a removable edge in . Then and an edge of are two nonadjacent removable edges in , a contradiction.
Now we consider and . Suppose that . Similar to last paragraph (when and ), we can show that is removable. Therefore, and an edge of are two nonadjacent removable edges in , a contradiction. Therefore, , that is, Statements 1) and 3) hold.
Case B. .
If and , then every edge in and is removable in and , respectively, and hence the edges in are removable in by Lemma 2.9. As and , there exist two nonadjacent edges in , contradicting the fact that is wheel-like.
Assume that and (the case when and is the same by exchanging the roles of and ). If exactly one vertex in , say , satisfies , then, similar to the case when and in Case A (by exchanging the roles of and ), we have satisfies Statements 1)-3). If there exist multiple edges between and at least two different vertices in , then this case is similar to last paragraph (when and in Case B). So there exist two nonadjacent removable edges in , a contradiction.
Last, we consider the case when . Then the underlying simple graph of is isomorphic to , or one of graphs in Figures 2 and 3. Recall that is not wheel-like. It can be checked that all the graphs in Figures 2 and 3 are not wheel-like. So the underlying simple graph of is not wheel-like. Therefore, is not wheel-like by Proposition 3.7, a contradiction. ∎

Lemma 3.11.
Assume that is the wheel-like brick which is the splicing of two odd wheels. Then is nonplanar.
Proof.
Lemma 3.12.
Assume that and are two cuts of a brick such that and are bricks, and is a matching covered bipartite graph . Then every edge incident with is removable in .
Proof.
Let and be the two color classes of . Without loss of generality, assume that . Suppose, to the contrary, that is nonremovable in ( and may be the same vertex). Then by Lemma 2.12 there exists an edge cut in , such that , , and .
As , . Let and . As and are bricks, and are 3-connected. Therefore, both and are connected and have odd numbers of vertices, respectively. If , then every vertex of , and are the components of . If , then is also odd in , and every vertex of and are the components of . We have whether is in or not, as . So is a barrier of . Then is a tight cut by a simple computation. Noting is a brick, is free of nontrivial tight cuts. As , we have , that is, . Since , we have , that is, .
Assume that . Note that is nonremovable in . Recalling , we have , contradicting the assumption that is a brick. Now we consider the case when . It can be checked that is also a barrier of by symmetry. So . Let . Similar to the case when , we have , and so . In , assume that is the corresponding edge of the edge . Then the end of in and is a 2-vertex cut of , contracting the fact that is a brick. ∎
Lemma 3.13.
Assume that and are two cuts of a brick such that and are bricks, and is a matching covered bipartite graph . If is an odd wheel such that is its hub and , then there exists a removable edge of such that both ends of belong to .
Proof.
Let . As is the hub of , every edge of lies in some removable class. Note that . Assume that is an edge of in where , and is the edge in corresponding to . Then is removable in by Lemma 3.12. If is removable in , then is also removable in by Lemma 2.9 as . Since , is removable in by Lemma 2.9 again. Moreover, the ends of belong to . The result follows by setting in this case. If is an edge of a removable doubleton in , assume that is a removable doubleton in . Then is a removable edge in by Theorem 2.10. So is removable in by Lemma 2.9 once more. As the ends of belong to , the result follows by setting . ∎
4 Proof of Theorem 1.3
Let be a planar wheel-like brick. By Lemma 3.8, we only need to consider the case when contains no multiple edges. If is a near-bipartite brick, then is isomorphic to by Lemma 3.3. Now we consider that is not a near-bipartite brick. We will prove this by induction on . If , then is by Proposition 3.6. The result follows. So we assume that the result holds for all the bricks with less than vertices, where is even. We now assume that . If is a solid brick, then is an odd wheel by Theorem 2.8. The theorem holds. So we consider the case when is a nonsolid brick. Then has a robust cut by Theorem 2.5. Let be a robust cut of such that and are near-bricks. Since is planar, both and are planar by Lemma 3.5.
We assume firstly that both of and are bricks. Recall that is wheel-like. Then at least one of and , say , is wheel-like and is its hub by Lemma 3.9. By the induction hypothesis, is an odd wheel. Then every edge of lies in some removable class of . By Lemma 3.9, is wheel-like. By the induction hypothesis, is an odd wheel. By Lemmas 3.10 and 3.11, the wheel-like brick is nonplanar, a contradiction.
Now we assume that at least one of and is not a brick. Then there are two cuts, say and , of such that is a bipartite matching covered graph , and and are bricks by Theorem 2.6.
Claim 1. and are wheel-like.
Proof.
Similar to the proof of 1) of Lemma 3.9 (with and in place of and , respectively), we have at least one of and is wheel-like, such that or is its hub.
Without loss of generality, we assume that is wheel-like and is its hub. By Lemma 3.5, is planar. So is an odd wheel by the induction hypothesis. Suppose that is not wheel-like. Then there is a removable class in such that . By Lemma 2.9 and Theorem 2.10, contains a removable edge in . Suppose that . By Lemma 3.13, there exists a removable edge in such that both ends of belong to . So and are two nonadjacent removable edges in , contradicting the assumption that is wheel-like. Therefore, we have . As is matching covered, and . So is isomorphic to . Recalling that is an odd wheel, every edge of lies in some removable class of . By Lemma 3.9, is wheel-like since is wheel-like. ∎
By Lemma 3.5, and are planar. So and are odd wheels by the induction hypothesis and Claim 1. Assume that and are the hubs of and , respectively. Let . By the proof of Claim 1, without loss of generality, assume that . Moreover, we have the following claim.
Claim 2. .
Proof.
Suppose, to the contrary, that . By Lemma 3.13, there exists a removable edge in such that both ends of belong to . If , then every edge of is a removable class in . Note that . If is a removable edge, then is also a removable edge in by Lemma 2.9, and if is a removable doubleton, then one edge of is also removable in by Theorem 2.10. So there exists an edge that is removable in and both ends of belong to . Therefore, and are two nonadjacent removable edges in , contradicting the assumption that is wheel-like. So . Suppose that . Then there exists an edge that is removable in and both ends of belong to by Lemma 3.13. So and are two nonadjacent removable edges in , a contradiction. Therefore, we have . Since is matching covered, it is connected. Then , that is .∎
By Claim 2, is isomorphic to . Recall that and are odd wheels. By Lemma 3.11, the graph is nonplanar, a contradiction. Therefore, the result holds.
References
- [1] J. A. Bondy and U. S. R. Murty, Graph Theory, Springer-Verlag, Berlin, 2008.
- [2] M. H. Carvalho, C. L. Lucchesi, and U. S. R. Murty, Ear decompositions of matching covered graphs. Combinatorica, 19: 151-174, 1999.
- [3] M. H. Carvalho, C. L. Lucchesi and U. S. R. Murty, On a conjecture of Lovász concerning bricks. II. Bricks of finite characteristic. J. Combin. Theory Ser. B, 85: 137-180, 2002.
- [4] M. H. Carvalho, C. L. Lucchesi and U. S. R. Murty, How to build a brick, Discrete Mathematics, 306: 2383-2410, 2006.
- [5] M. H. Carvalho, C. L. Lucchesi and U. S. R. Murty, A generalization of Little’s theorem on Pfaffian graphs, J. Combin. Theory Ser. B, 102: 1241-1266, 2012.
- [6] J. Edmonds, L. Lovász and W. R. Pulleyblank, Brick decompositions and the matching rank of graphs, Combinatorica, 2(3): 247-274, 1982.
- [7] C. L. Lucchesi and U. S. R. Murty, Perfect Matchings: A Theory of Matching Covered Graphs, Springer Nature Switzerland, 2024.
- [8] L. Lovász. Ear decompositions of matching covered graphs. Combinatorica, 2: 105-117, 1983.
- [9] L. Lovász, Matching structure and the matching lattice, J. Combin. Theory Ser. B, 43: 187-222, 1987.
- [10] L. Lovász and M. D. Plummer, Matching Theory, Annals of Discrete Mathematics, vol. 29, Elsevier Science, 1986.
- [11] Y. Wang, J. Deng and F. Lu, Removable edges in Halin graphs, Discrete Applied Mathematics, 349: 1-7, 2024.
- [12] X. Wu, F. Lu and L, Zhang, Removable edges in claw-free bricks, Graphs and Combinatorics, 40: 43, 2024.
- [13] S. Zhai, C. L. Lucchesi and X. Guo, A lower bound on the number of removable ears of 1-extendable graphs, Discrete Math., 310(5): 1123-1126, 2010.
- [14] S. Zhai and X. Guo, Removable ears of 1-extendable graphs, J. Syst. Sci. Complex, 23: 372-378, 2010.