This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

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)

Fuliang Lu, Jinxin Xue
School of Mathematics and Statistics, Minnan Normal University, Zhangzhou, China
Abstract

An edge ee in a matching covered graph GG is removable if GeG-e is matching covered; a pair {e,f}\{e,f\} of edges of GG is a removable doubleton if GefG-e-f is matching covered, but neither GeG-e nor GfG-f 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 GG is wheel-like if GG has a vertex hh, such that every removable class of GG has an edge incident with hh. 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 ee of a graph GG is a multiple edge if there are at least two edges of GG with the same ends as ee). We follow [1] and [10] for undefined notations and terminologies. Let GG be a graph with the vertex set V(G)V(G) and the edge set E(G)E(G). For X,YV(G)X,Y\subseteq V(G), by EG[X,Y]E_{G}[X,Y], or simply E[X,Y]E[X,Y], we mean the set of edges of GG with one end vertex in XX and the other end vertex in YY. We shall simply write E[x,y]E[x,y] for E[X,Y]E[X,Y] if X={x}X=\{x\} and Y={y}Y=\{y\}. Let G(X)=EG[X,X¯]\partial_{G}(X)=E_{G}[X,\overline{X}] be an edge cut of GG, where X¯=V(G)X\overline{X}=V(G)\setminus X. (If GG is understood, the subscript GG is omitted.) If X={u}X=\{u\}, then we denote G({u})\partial_{G}(\{u\}), for brevity, by G(u)\partial_{G}(u) or (u)\partial(u). An edge cut (X)\partial(X) is trivial if |X|=1|X|=1 or |X¯|=1|\overline{X}|=1.

Let GG be a graph with a perfect matching. An edge ee in GG is forbidden if ee does not lie in any perfect matching of GG. A connected nontrivial graph is matching covered if each of its edges is not forbidden. We denote by G/(Xx)G/(X\rightarrow x) the graph obtained from GG by contracting XX to a single vertex xx, for brevity, by G/XG/X. The graphs G/XG/X and G/X¯G/\overline{X} are the two (X)\partial(X)-contractions of GG. An edge cut (X)\partial(X) is separating if both (X)\partial(X)-contractions of GG are matching covered, and is tight if every perfect matching contains exactly one edge of (X)\partial(X). 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 GG is bicritical if G{u,v}G-\{u,v\} has a perfect matching for any two vertices uu and vv of GG.

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 GG yield the same number of bricks; this number is denoted by b(G)b(G). A near-brick GG is a matching covered graph with b(G)=1b(G)=1. Obviously, a brick is a near-brick.

We say that an edge ee in a matching covered graph GG is removable if GeG-e is matching covered. A pair {e,f}\{e,f\} of edges of a matching covered graph GG is a removable doubleton if GefG-e-f is matching covered, but neither GeG-e nor GfG-f is. Removable edges and removable doubletons are called removable classes.

Lovász [8] proved that every brick distinct from K4K_{4} and C6¯\overline{C_{6}} (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 Δ(G)\Delta(G) removable classes, where Δ(G)\Delta(G) is the maximum of the degrees of vertices in GG.

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 GG in terms of the number of the perfect matchings needed to cover all edges of GG and the edge-chromatic number, respectively. Wu et al. [12] showed every claw-free brick GG with more than 6 vertices has at least 5|V(G)|/85|V(G)|/8 removable edges. Wang et al. [11] obtained the number of removable edges of Halin graphs GG with even number of vertices, other than K4K_{4}, C6¯\overline{C_{6}} and R8R_{8} (see Figure 1 (right)), is at least (|V(G)|+2)/4(|V(G)|+2)/4. Generally, Lucchesi and Murty [7] conjectured that there exist a positive real number cc and an integer NN such that any brick GG of order at least NN has c|V(G)|c|V(G)| removable edges.

For an integer k3k\geq 3, the wheel WkW_{k} is the graph obtained from a cycle CC of length kk by adding a new vertex hh and joining it to all vertices of CC. The cycle CC is the rim of WkW_{k}, the vertex hh is its hub. Obviously, every wheel is planar. A wheel WkW_{k} is odd if kk is odd. The graph K4K_{4} (a complete graph with 4 vertices) is an odd wheel that every edge lies in a removable doubleton. For an odd wheel other than K4K_{4}, 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 GG is wheel-like if GG has a vertex hh, called its hub, such that every removable class of GG has an edge in (h)\partial(h). 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 GG is an odd wheel and all multiple edges of GG are incident with the hub.

2 Preliminaries

We begin with some notations. For a vertex set XV(G)X\subset V(G), denote by G[X]G[X] the subgraph induced by XX, by N(X)N(X), or simply N(u)N(u) when X={u}X=\{u\}, the set of all vertices in X¯\overline{X} adjacent to vertices in XX. Let dG(u)=|N(u)|d_{G}(u)=|N(u)|. Let GG be a graph with a perfect matching. A nonempty vertex set SS of GG is a barrier of GG if o(GS)=|S|o(G-S)=|S|, where o(GS)o(G-S) is the number of components with odd number of vertices of GSG-S. Tutte proved the following theorem which characterizes graphs that have a perfect matching in 1947.

Theorem 2.1 (Tutte).

A graph GG has a perfect matching if and only if o(GX)|X|o(G-X)\leq|X|, for every XV(G)X\subseteq V(G).

The following result can be obtained by Theorem 2.1.

Lemma 2.2 ([5]).

Assume that GG is a graph with a perfect matching. An edge uvuv is forbidden if and only if there exists a barrier containing uu and vv.

Let GG and HH be two vertex-disjoint graphs and let uu and vv be vertices of GG and HH, respectively, such that dG(u)=dH(v)d_{G}(u)=d_{H}(v). Moreover, let θ\theta be a given bijection between G(u)\partial_{G}(u) and H(v)\partial_{H}(v). We denote by (G(u)H(v))θ(G(u)\odot H(v))_{\theta} the graph obtained from the union of GuG-u and HvH-v by joining, for each edge ee in H(v)\partial_{H}(v), the end of ee in HH belonging to V(H)vV(H)-v to the end of θ(e)\theta(e) in GG belonging to V(G)uV(G)-u; and refer to (G(u)H(v))θ(G(u)\odot H(v))_{\theta} as the graph obtained by splicing GG (at uu), with HH (at vv), with respect to the bijection θ\theta, for brevity, to G(u)H(v)G(u)\odot H(v). In general, the graph resulting from splicing two graphs GG and HH depends on the choice of uu, vv and θ\theta. 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, G(u)H(v)G(u)\odot H(v) is a matching covered graph if GG and HH are matching covered. Let C=(V(G){u})C=\partial(V(G)\setminus\{u\}). Then the two CC-contractions of G(u)H(v)G(u)\odot H(v) are GG and HH, respectively. Therefore, the edge cut CC is separating in G(u)H(v)G(u)\odot H(v). A matching covered graph GG is near-bipartite if it has a removable doubleton RR such that the subgraph GRG-R obtained by the deletion of RR is a (matching covered) bipartite graph. In fact, every brick with a removable doubleton is near-bipartite [9]. So, if {e,f}\{e,f\} is a removable doubleton of a brick GG, then both ends of ee lie in one color class of G{e,f}G-\{e,f\}, and both ends of ff 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 K4K_{4}, C6¯\overline{C_{6}} and R8R_{8}, has two nonadjacent removable edges.

Let GG be a matching covered graph. A separating cut CC of GG is a robust cut if CC is not tight and both CC-contractions of GG are near-bricks.

Theorem 2.5 ([3]).

Every nonsolid brick GG has a robust cut.

Theorem 2.6 ([3]).

Let GG be a brick and (X)\partial(X) be a robust cut of GG. Then, there exists a subset XX^{\prime} of XX and a superset X′′X^{\prime\prime} of XX such that G/X¯G/\overline{X^{\prime}} and G/X′′G/{X^{\prime\prime}} are bricks and the graph HH, obtained from GG by contracting XX^{\prime} and X′′¯\overline{X^{\prime\prime}} to single vertices xx^{\prime} and x′′¯\overline{x^{\prime\prime}}, respectively, is bipartite and matching covered, where xx^{\prime} and x′′¯\overline{x^{\prime\prime}} lie in different color classes of HH.

As a type of (solid) bricks, odd wheels play a crucial role in our proof.

Proposition 2.7 ([4]).

Let GG be a simple brick on six vertices. Then GG is either nonsolid or the 5-wheel W5W_{5}.

Theorem 2.8 ([4]).

Every simple planar solid brick GG is an odd wheel.

Let (X)\partial(X) be a separating cut of matching covered graph GG and eE(G)e\in E(G). If eE(G/X)e\notin E(G/X), we also say ee is removable in G/XG/X. The following results are about the removable edges in CC-contractions.

Lemma 2.9 (Corollary 8.9 in [7]).

Let GG be a matching covered graph, and let CC be a separating cut of GG. If an edge ee is removable in both CC-contractions of GG, then ee is removable in GG.

Theorem 2.10 (Lemma 3.1 in [3]).

Let C=(X)C=\partial(X) be a separating but not tight cut of a matching covered graph GG and let H=G/X¯H=G/\overline{X}. Assume that HH is a brick, and let RR be a removable doubleton of HH. If RC=R\cap C=\emptyset or if the edge of RCR\cap C is removable in G/XG/X then RCR-C contains an edge which is removable in GG.

Lemma 2.11.

Assume that GG is a brick, and (X)\partial(X) is an edge cut of GG such that both G/(Xx)G/(X\rightarrow x) and G/(X¯x¯)G/(\overline{X}\rightarrow\overline{x}) are brick. If e(X)e\in\partial(X), and {e,f}\{e,f\} and {e,g}\{e,g\} are removable doubletons of G/XG/X and G/X¯G/\overline{X}, respectively, then {f,g}\{f,g\} is a removable doubleton of GG.

Proof.

Obviously, dG/X(x)=dG/X¯(x¯)d_{G/X}(x)=d_{G/\overline{X}}(\overline{x}). Let H1=G/X{e,f}H_{1}=G/X-\{e,f\} and H2=G/X¯{e,g}H_{2}=G/\overline{X}-\{e,g\}. As e(X)e\in\partial(X), dH1(x)=dH2(x¯)d_{H_{1}}(x)=d_{H_{2}}(\overline{x}). Then G{e,f,g}G-\{e,f,g\} is isomorphic to H1(x)H2(x¯)H_{1}(x)\odot H_{2}(\overline{x}). By the definition of removable doubletons, H1H_{1} and H2H_{2} are matching covered bipartite graphs. Therefore, G{e,f,g}G-\{e,f,g\} is matching covered by Proposition 2.3. Assume that AiA_{i} and BiB_{i} are the two color classes of HiH_{i} such that both ends of ee lie in BiB_{i} for i=1,2i=1,2. Then G{e,f,g}G-\{e,f,g\} is a bipartite graph with two color classes: A1B2{x¯}A_{1}\cup B_{2}\setminus\{\overline{x}\} and A2B1{x}A_{2}\cup B_{1}\setminus\{{x}\}. Note that EG[B1,B2]={e}E_{G}[B_{1},B_{2}]=\{e\}. So G{f,g}G-\{f,g\} is bipartite. And then it is matching covered by Theorem 4.1.1 in [10]. As two ends of ff lie in A1A_{1}, and two ends of gg lie in A2A_{2}, GfG-f and GgG-g 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 GG be a bipartite matching covered graph with AA and BB as its color classes, and |E(G)|2|E(G)|\geq 2. An edge uvuv of GG, with uAu\in A and vBv\in B, is not removable in GG if and only if there exist nonempty proper subsets A1A_{1} and B1B_{1} of AA and BB, respectively, such that:

1) the subgraph G[A1B1]G[A_{1}\cup B_{1}] is matching covered, and

2) uA1u\in A_{1} and vBB1v\in B\setminus B_{1}, and E[A1,BB1]={uv}E[A_{1},B\setminus B_{1}]=\{uv\}.

3 Lemmas

In this section, we will present some useful lemmas.

Proposition 3.1.

Let GG be a matching covered graph. Assume that N(u)={u1,u2,u3}N(u)=\{u_{1},u_{2},u_{3}\} and G[{u,u2,u3}]G[\{u,u_{2},u_{3}\}] is a triangle. Then uu1uu_{1} is not removable.

Proof.

It can be checked that {u2,u3}\{u_{2},u_{3}\} is a barrier of Guu1G-uu_{1}. By Lemma 2.2, u2u3u_{2}u_{3} is forbidden in Guu1G-uu_{1}. So the result holds. ∎

We say an edge ee in a matching covered graph satisfies the triangle condition if one end of ee is of degree 3, and lie in a triangle that does not contain ee. If ee satisfies the triangle condition, then ee is not removable by Proposition 3.1.

Proposition 3.2.

C6¯\overline{C_{6}} and R8R_{8} are not wheel-like.

Proof.

As shown in Figure 1, {ei,fi}\{e_{i},f_{i}\} is a removable doubleton for i=1,2,3i=1,2,3, and the bold edge is a removable edge. So the result follows. ∎

Refer to caption
Refer to caption
Figure 1: C6¯\overline{C_{6}} (left) and R8R_{8} (right).
Lemma 3.3.

Let GG be a simple near-bipartite brick. Then GG is wheel-like if and only if GG is isomorphic to K4K_{4}.

Proof.

If |V(G)|=4|V(G)|=4, then GG is isomorphic to K4K_{4}, which is wheel-like. Suppose that |V(G)|6|V(G)|\geq 6. By Proposition 3.2,C6¯,\overline{C_{6}} and R8R_{8} are not wheel-like. If GG is distinct from C6¯\overline{C_{6}} and R8R_{8}, then GG has two nonadjacent removable edges by Theorem 2.4, so it is not wheel-like. ∎

We will need the following theorem about planar graphs.

Theorem 3.4 (Kuratowski’s Theorem).

Let GG be a graph. Then GG is nonplanar if and only if GG contains a subgraph that is a subdivision of either K3,3K_{3,3} or K5K_{5}.

Lemma 3.5.

Let GG be a planar brick and (X)\partial(X) be a separating cut of GG. Then G/XG/X and G/X¯G/\overline{X} are planar.

Proof.

By Theorem 3.4, GG contains no subgraphs that is a subdivision of either K3,3K_{3,3} or K5K_{5}. As G/X¯G/{\overline{X}} is matching covered, it is 2-connected (see Remark 2 on Page 145 of [10]). Then G[X]G[{X}] is connected. So G/XG/X contains no subgraphs that is a subdivision of either K3,3K_{3,3} or K5K_{5}. Therefore, G/XG/X is planar. So does G/X¯G/\overline{X}. ∎

Proposition 3.6.

Let GG be a simple planar brick with six vertices. Then GG is a wheel-like brick if and only if GG is W5W_{5}.

Proof.

By Proposition 2.7, GG is either nonsolid or W5W_{5}. As W5W_{5} is wheel-like, we may assume that GG is a nonsolid brick. Then GG has a nontrivial separating cut CC. Since GG is 3-connected and both CC-contractions of GG are matching covered, both CC-contractions of GG are isomorphic to K4K_{4}’s (up to multiple edges). It can be checked that GG is isomorphic to C6¯\overline{C_{6}} or one of the graphs in Figure 2. By Proposition 3.2, C6¯\overline{C_{6}} 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. ∎

Refer to caption
Figure 2: Planar bricks with six vertices, where the bold edges are removable.

When we turn to the graphs with multiple edges, we have the following proposition.

Proposition 3.7.

Let GG be a matching covered graph and eE(G)e\in E(G). And let HH be obtained from GG by adding an edge ff to two ends of ee. Then ee and ff are removable in HH. Therefore, if GG is not wheel-like, then HH is not wheel-like.

Proof.

As HeGHfH-e\cong G\cong H-f and GG is matching covered, both ee and ff are removable in HH. Obviously, an edge that is removable in GG is removable in HH. If {e,e}\{e,e^{\prime}\} is a removable doubleton of GG, then every perfect matching of HH containing ee or ff contains ee^{\prime}. So ee and ff are forbidden in HeH-e^{\prime}, that is, ee^{\prime} is not removable in HH. Therefore, if GG does not contain any vertex vv such that each removable class of GG has an edge in (v)\partial(v), neither does HH. ∎

Lemma 3.8.

Let GG be a wheel-like brick and uhu_{h} is its hub. Then all the multiple edges are incident with uhu_{h}.

Proof.

Assume that the underlying simple graph of GG is HH. If G=HG=H, the result holds obviously. So we assume that GHG\neq H. If HH is near-bipartite, then HH is K4K_{4} by Lemma 3.3. By Proposition 3.7, all the multiple edges of HH are incident with a common vertex. If HH is not near-bipartite, then every removable class of HH is a removable edge. By Theorem 1.1, uhu_{h} is incident with at least three removable edges. By Proposition 3.7 again, every multiple edge is incident with uhu_{h}. ∎

Lemma 3.9.

Assume that G1G_{1} and G2G_{2} are two disjoint bricks, uV(G1)u\in V(G_{1}) and vV(G2)v\in V(G_{2}). Let G=(G1(u)G2(v))θG=({G_{1}(u)\odot G_{2}(v)})_{\theta}. If GG is a wheel-like brick, then the following statements hold.
1) At least one of G1G_{1} and G2G_{2} is wheel-like such that uu or vv is its hub.
2) If G1G_{1} is wheel-like, uu is its hub, and every edge of G1(u)\partial_{G_{1}}(u) lies in some removable class of G1G_{1}, then G2G_{2} is also wheel-like.

Proof.

1) By Theorem 1.1, G1G_{1} and G2G_{2} contain at least three removable classes, respectively. Suppose that R1R_{1} and R2R_{2} are removable classes of G1G_{1} and G2G_{2}, respectively, such that R1(u)=R_{1}\cap\partial(u)=\emptyset and R2(v)=R_{2}\cap\partial(v)=\emptyset. Then R1R2R_{1}\cup R_{2} is a matching in GG. For i{1,2}i\in\{1,2\}, if RiR_{i} is a removable edge, then RiR_{i} is also a removable edge in GG by Lemma 2.9, and if RiR_{i} is a removable doubleton, then one edge of RiR_{i} is also removable in GG by Theorem 2.10. It means that R1R2R_{1}\cup R_{2} contains two nonadjacent removable edges of GG, contradicting the fact that GG is wheel-like. So at least one of G1G_{1} and G2G_{2} is wheel-like, such that uu or vv is its hub.

2) Suppose, to the contrary, that G2G_{2} is not a wheel-like brick. Let F1F_{1}, F2F_{2} and F3F_{3} be removable classes of G2G_{2} such that there does not exist any vertex in G2G_{2} incident with one edge in F1F_{1}, F2F_{2} and F3F_{3}, respectively. For i=1,2,3i=1,2,3, if Fi(v)=F_{i}\cap\partial(v)=\emptyset, or Fi(v)={ei}F_{i}\cap\partial(v)=\{e_{i}\} and θ(ei)\theta(e_{i}) is removable in G1G_{1}, then FiF_{i} contains a removable edge in GG by Lemma 2.9 and Theorem 2.10; if Fi(v)={ei}F_{i}\cap\partial(v)=\{e_{i}\}, and {θ(ei),ei}\{\theta(e_{i}),e_{i}^{\prime}\} is a removable doubleton in G1G_{1}, then by Theorem 2.10, the edge eie_{i}^{\prime} is a removable edge in GG. (If ei(v)e_{i}\in\partial(v), eie_{i} lies in a removable doubleton of G2G_{2}, and θ(ei)\theta(e_{i}) lies in a removable doubleton in G1G_{1}, then GG has a removable doubleton by Lemma 2.11, and so the underlying simple graph of GG is K4K_{4} by Lemma 3.3, contradicting the assumption that GG is a splicing of two bricks.) So, in above both alternatives, for each FiF_{i} (i=1,2,3i=1,2,3), we have a removable class FiF_{i}^{\prime} of GG such that FiFiF_{i}^{\prime}\subset F_{i} or Fi(E(G1)(u))F_{i}^{\prime}\subset(E(G_{1})\setminus\partial(u)). Therefore, there does not exist any vertex in GG incident with one edge in F1F_{1}^{\prime}, F2F_{2}^{\prime} and F3F_{3}^{\prime}, respectively, contradicting the fact that GG is wheel-like. ∎

Lemma 3.10.

Let GG and HH be two odd wheels such that V(G)={uh,u1,u2,,us}V(G)=\{u_{h},u_{1},u_{2},\ldots,u_{s}\} and V(H)={vh,v1,v2,,vt}V(H)=\{v_{h},v_{1},v_{2},\ldots,v_{t}\}, where uhu_{h} and vhv_{h} are the hubs of GG and HH, respectively. Assume that uV(G)u\in V(G), vV(H)v\in V(H), dG(u)=dH(v)d_{G}(u)=d_{H}(v) and G(u)H(v)G(u)\odot H(v) is a brick. The graph G(u)H(v)G(u)\odot H(v) is wheel-like if and only if the following statements hold.

1). |{u,v}{uh,vh}|=1|\{u,v\}\cap\{u_{h},v_{h}\}|=1. Without loss of generality, assume that u=uhu=u_{h}, that is vvhv\neq v_{h}. Then |V(G)|6|V(G)|\geq 6.

2). All the multiple edges of GG and HH are incident with uhu_{h} and vhv_{h}, respectively.

3). Without loss of generality, assume that v=vtv=v_{t} and {u1v1,urvt1}E(G(u)H(v))\{u_{1}v_{1},u_{r}v_{t-1}\}\subset E(G(u)\odot H(v)), where 1rs1\leq r\leq s. Then r1r\neq 1 and u1urE(G)u_{1}u_{r}\notin E(G).

Proof.

Assume that uiui+1E(G)u_{i}u_{i+1}\in E(G) for i=1,2,,si=1,2,\ldots,s (the subscript is modulo ss), and vivi+1E(H)v_{i}v_{i+1}\in E(H) for i=1,2,,ti=1,2,\ldots,t (the subscript is modulo tt). Let W=G(u)H(v)W=G(u)\odot H(v) and C=W(V(G){u})C=\partial_{W}(V(G)\setminus\{u\}).

We will prove the sufficiency firstly. By Statement 2), every multiple edge is incident with the hub. Then |E[v,vh]|=dG(u)2|E[v,v_{h}]|=d_{G}(u)-2. We will prove the edge in E(W)(vh)E(W)\setminus\partial(v_{h}) is nonremovable. As u1urE(W)u_{1}u_{r}\notin E(W), that is r2r\neq 2 and rsr\neq s, we consider the following alternatives.

Case 1. r=3ors1r=3~{}\mbox{or}~{}s-1.

Assume that ur=u3u_{r}=u_{3} (the case when ur=us1u_{r}=u_{s-1} is the same by symmetry). Let Bu1u2={vh,u3,vt2}B_{u_{1}u_{2}}=\{v_{h},u_{3},v_{t-2}\}. Then WBu1u2u1u2W-B_{u_{1}u_{2}}-{u_{1}u_{2}} has exactly three components: W[{u2}],W[{vt1}]W[\{u_{2}\}],W[\{v_{t-1}\}] and W[V(G)({u2,vt1}Bu1u2)]W[V(G)\setminus(\{u_{2},v_{t-1}\}\cup B_{u_{1}u_{2}})], all of which are odd. Therefore, Bu1u2B_{u_{1}u_{2}} is a barrier of Wu1u2W-{u_{1}u_{2}} containing both ends of the edge vt2vhv_{t-2}v_{h}. By Lemma 2.2, u1u2u_{1}u_{2} is nonremovable in WW. By symmetry, u2u3u_{2}u_{3} is also nonremovable in WW.

Assume that s=5s=5. It can be checked {vh,u3,vt2}\{v_{h},u_{3},v_{t-2}\} is a barrier of Wu4u5W-u_{4}u_{5} containing vt2vhv_{t-2}v_{h}. So u4u5u_{4}u_{5} is nonremovable in WW. If t=3t=3, {vh,u1,us1}\{v_{h},u_{1},u_{s-1}\} is a barrier of Wv1v2W-v_{1}v_{2} containing us1vhu_{s-1}v_{h}. So v1v2v_{1}v_{2} are nonremovable in WW. Every edge of E(W)(vh){u1u2,u2u3,u4u5,v1v2}E(W)\setminus\partial(v_{h})\setminus\{u_{1}u_{2},u_{2}u_{3},u_{4}u_{5},v_{1}v_{2}\} satisfies the triangle condition, and then it is not removable by Proposition 3.1. If t5t\geq 5, then every edge in E(W)(vh){u1u2,u2u3,u4u5}E(W)\setminus\partial(v_{h})\setminus\{u_{1}u_{2},u_{2}u_{3},u_{4}u_{5}\} satisfies the triangle condition; so it is not removable by Proposition 3.1 again.

Now we assume that s7s\geq 7. If t=3t=3, it can be checked {vh,u1,us1}\{v_{h},u_{1},u_{s-1}\} is a barrier of Wv1v2W-v_{1}v_{2} containing us1vhu_{s-1}v_{h}. So v1v2v_{1}v_{2} are nonremovable in WW. Every edge of E(W)(vh){u1u2,u2u3,v1v2}E(W)\setminus\partial(v_{h})\setminus\{u_{1}u_{2},u_{2}u_{3},v_{1}v_{2}\} satisfies the triangle condition, and then it is not removable by Proposition 3.1. If t5t\geq 5, then every edge of E(W)(vh){u1u2,u2u3}E(W)\setminus\partial(v_{h})\setminus\{u_{1}u_{2},u_{2}u_{3}\} satisfies the triangle condition; so it is not removable by Proposition 3.1 once more.

Case 2. r=4ors2r=4~{}\mbox{or}~{}s-2.

Without loss of generality, assume that ur=u4u_{r}=u_{4} (the case when ur=us2u_{r}=u_{s-2} is the same by symmetry). Let Bu2u3={vh,u4,vt2}B_{u_{2}u_{3}}=\{v_{h},u_{4},v_{t-2}\}. Then WBu2u3u2u3W-B_{u_{2}u_{3}}-{u_{2}u_{3}} has exactly three components: W[{u3}],W[{vt1}]W[\{u_{3}\}],W[\{v_{t-1}\}] and W[V(G)({u3,vt1}Bu2u3)]W[V(G)\setminus(\{u_{3},v_{t-1}\}\cup B_{u_{2}u_{3}})], which are odd. Therefore, Bu2u3B_{u_{2}u_{3}} is a barrier of Wu2u3W-{u_{2}u_{3}} containing both ends of the edge vt2vhv_{t-2}v_{h}. By Lemma 2.2, u2u3u_{2}u_{3} is nonremovable in WW. If t5t\geq 5, then every edge of E(W)(vh){u2u3}E(W)\setminus\partial(v_{h})\setminus\{u_{2}u_{3}\} satisfies the triangle condition; so it is not removable by Proposition 3.1. Then we consider the case when t=3t=3. It can be checked {vh,u1,us1}\{v_{h},u_{1},u_{s-1}\} is a barrier of Wv1v2W-v_{1}v_{2} containing us1vhu_{s-1}v_{h}. So v1v2v_{1}v_{2} is nonremovable in WW. Note that every edge of E(W)(vh){u2u3,v1v2}E(W)\setminus\partial(v_{h})\setminus\{u_{2}u_{3},v_{1}v_{2}\} satisfies the triangle condition, and then it is not removable by Proposition 3.1 again.

Case 3. 5rs35\leq r\leq s-3.

If t=3t=3, it can be checked {vh,u1,us1}\{v_{h},u_{1},u_{s-1}\} is a barrier of Wv1v2W-v_{1}v_{2} containing us1vhu_{s-1}v_{h}. So v1v2v_{1}v_{2} is nonremovable in WW. Note that every edge of E(W)(vh){v1v2}E(W)\setminus\partial(v_{h})\setminus\{v_{1}v_{2}\} satisfies the triangle condition, and then it is not removable by Proposition 3.1. If t5t\geq 5, then every edge of E(W)(vh)E(W)\setminus\partial(v_{h}) satisfies the triangle condition; so it is not removable by Proposition 3.1 again. Therefore, WW is wheel-like.

We now turn to the necessary. By Lemma 3.9, at least one of GG and HH is wheel-like such that uu or vv is its hub. Without loss of generality, assume that GG is wheel-like and u=uhu=u_{h} (in fact, GG is an odd wheel). Since every edge in G(uh)\partial_{G}(u_{h}) is a removable class in GG, HH is wheel-like by Lemma 3.9. By Lemma 3.8, every multiple edge of GG or HH is incident with the hubs, that is, Statement 2) holds. We will obtain a contradiction that WW is not wheel-like if it does not satisfy Statements 1)-3).

Case A. v=viv=v_{i} for i{1,2,,t}i\in\{1,2,\ldots,t\}.

Without loss of generality, assume that vi=vtv_{i}=v_{t} and u1v1E(W)u_{1}v_{1}\in E(W). Assume that urvt1E(W)u_{r}v_{t-1}\in E(W). As WW is a brick, it is 3-connected. Then uru1u_{r}\neq u_{1}. Otherwise, {u1,vh}\{u_{1},v_{h}\} is 2-vertex cut in WW.

If s=t=3s=t=3, then the underlying simple graph of WW is isomorphic to C6¯\overline{C_{6}} or the first two graphs in Figure 2. By Proposition 3.2, C6¯\overline{C_{6}} is not wheel-like. Note that the first two graphs in Figure 2 are not wheel-like. So the underlying simple graph of WW is not wheel-like. Therefore, WW is not wheel-like by Proposition 3.7, a contradiction.

Next, we consider s=3s=3 and t5t\geq 5. Since ((vh)E[vt,vh])C=(\partial(v_{h})\setminus E[v_{t},v_{h}])\cap C=\emptyset and every edge in (vh)\partial(v_{h}) is removable in HH, every edge in (vh)E[vt,vh]\partial(v_{h})\setminus E[v_{t},v_{h}] is removable in WW by Lemma 2.9. Without loss of generality, assume that r=2r=2. Then it can be checked that Wu1u2W-u_{1}u_{2} 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 Wu1u2W-u_{1}u_{2} is matching covered, and then u1u2u_{1}u_{2} is a removable edge in WW. Then u1u2u_{1}u_{2} and an edge of (vh)E[vt,vh]\partial(v_{h})\setminus E[v_{t},v_{h}] are two nonadjacent removable edges in WW, a contradiction.

Now we consider s5s\geq 5 and t3t\geq 3. Suppose that r=2orsr=2~{}\mbox{or}~{}s. Similar to last paragraph (when s=3s=3 and t5t\geq 5), we can show that u1uru_{1}u_{r} is removable. Therefore, u1uru_{1}u_{r} and an edge of (vh)E[vt,vh]\partial(v_{h})\setminus E[v_{t},v_{h}] are two nonadjacent removable edges in WW, a contradiction. Therefore, 2<r<s2<r<s, that is, Statements 1) and 3) hold.

Case B. v=vhv=v_{h}.

If s5s\geq 5 and t5t\geq 5, then every edge in (uh)\partial(u_{h}) and (vh)\partial(v_{h}) is removable in GG and HH, respectively, and hence the edges in CC are removable in WW by Lemma 2.9. As s5s\geq 5 and t5t\geq 5, there exist two nonadjacent edges in CC, contradicting the fact that WW is wheel-like.

Assume that s=3s=3 and t5t\geq 5 (the case when t=3t=3 and s5s\geq 5 is the same by exchanging the roles of GG and HH). If exactly one vertex in {u1,u2,u3}\{u_{1},u_{2},u_{3}\}, say u1u_{1}, satisfies |E[uh,u1]|2|E[u_{h},u_{1}]|\geq 2, then, similar to the case when t=3t=3 and s5s\geq 5 in Case A (by exchanging the roles of GG and HH), we have WW satisfies Statements 1)-3). If there exist multiple edges between uhu_{h} and at least two different vertices in {u1,u2,u3}\{u_{1},u_{2},u_{3}\}, then this case is similar to last paragraph (when s5s\geq 5 and t5t\geq 5 in Case B). So there exist two nonadjacent removable edges in WW, a contradiction.

Last, we consider the case when s=t=3s=t=3. Then the underlying simple graph of WW is isomorphic to C6¯\overline{C_{6}}, or one of graphs in Figures 2 and 3. Recall that C6¯\overline{C_{6}} 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 WW is not wheel-like. Therefore, WW is not wheel-like by Proposition 3.7, a contradiction. ∎

Refer to caption
Figure 3: Illustration for the proof of Lemma 3.10, where the bold edges are removable.
Lemma 3.11.

Assume that WW is the wheel-like brick which is the splicing of two odd wheels. Then WW is nonplanar.

Proof.

By Lemma 3.10, WW satisfies Statements 1)-3) of Lemma 3.10. Using the notations in the proof of Lemma 3.10, W{u1,ur,vh}W-\{u_{1},u_{r},v_{h}\} has three components C1=W[{u2,,ur1}]C_{1}=W[\{u_{2},\ldots,u_{r-1}\}], C2=W[{ur+1,,us}]C_{2}=W[\{u_{r+1},\ldots,u_{s}\}] and C3=W[{v1,,vt1}]C_{3}=W[\{v_{1},\ldots,v_{t-1}\}]. Then, CiC_{i} (i{1,2,3}i\in\{1,2,3\}), u1u_{1},uru_{r},vhv_{h} and suitable paths between them form a subdivision of K3,3K_{3,3} (the vertex set {u1,ur,vh}\{u_{1},u_{r},v_{h}\} is one of its color class). By Theorem 3.4, WW is nonplanar. ∎

Lemma 3.12.

Assume that (X)\partial(X) and (Y)\partial(Y) are two cuts of a brick GG such that G/XG/{X} and G/YG/{Y} are bricks, and G/(X¯x¯)/(Y¯y¯)G/(\overline{X}\rightarrow\overline{x})/(\overline{Y}\rightarrow\overline{y}) is a matching covered bipartite graph HH. Then every edge incident with x¯\overline{x} is removable in HH.

Proof.

Let AA and BB be the two color classes of HH. Without loss of generality, assume that x¯A\overline{x}\in A. Suppose, to the contrary, that x¯b\overline{x}b is nonremovable in HH (bb and y¯\overline{y} may be the same vertex). Then by Lemma 2.12 there exists an edge cut (Z)\partial(Z) in HH, such that x¯ZA\overline{x}\in Z\cap A, bZ¯Bb\in\overline{Z}\cap B, |ZA|=|ZB||Z\cap A|=|Z\cap B| and {x¯b}=E[ZA,Z¯B]\{\overline{x}b\}=E[Z\cap A,\overline{Z}\cap B].

As {x¯b}=E[ZA,Z¯B]\{\overline{x}b\}=E[Z\cap A,\overline{Z}\cap B], N((Z¯B){b})Z¯AN((\overline{Z}\cap B)\setminus\{b\})\subseteq\overline{Z}\cap A. Let S=Z¯AS=\overline{Z}\cap A and Q=Z{b}Q=Z\cup\{b\}. As G/XG/{X} and G/YG/{Y} are bricks, G/XG/{X} and G/YG/{Y} are 3-connected. Therefore, both G[X¯]G[\overline{X}] and G[Y¯]G[\overline{Y}] are connected and have odd numbers of vertices, respectively. If y¯Q\overline{y}\notin Q, then every vertex of (Z¯B){b,y¯}(\overline{Z}\cap B)\setminus\{b,\overline{y}\}, G[Q]G[Q] and G[Y¯]G[\overline{Y}] are the components of GSG-S. If y¯Q\overline{y}\in Q, then |(QY¯){y¯}||(Q\cup\overline{Y})\setminus\{\overline{y}\}| is also odd in GG, and every vertex of (Z¯B){b}(\overline{Z}\cap B)\setminus\{b\} and QQ are the components of GSG-S. We have o(GS)=|S|o(G-S)=|S| whether y¯\overline{y} is in QQ or not, as |Z¯A|=|Z¯B||\overline{Z}\cap A|=|\overline{Z}\cap B|. So SS is a barrier of GG. Then (Q)\partial(Q) is a tight cut by a simple computation. Noting GG is a brick, GG is free of nontrivial tight cuts. As {b,x¯}Q\{b,\overline{x}\}\subset Q, we have |Q¯|=1|\overline{Q}|=1, that is, |Z¯A|=1|\overline{Z}\cap A|=1. Since |Z¯A|=|Z¯B||\overline{Z}\cap A|=|\overline{Z}\cap B|, we have |Z¯B|=1|\overline{Z}\cap B|=1, that is, {b}=Z¯B\{b\}=\overline{Z}\cap B.

Assume that y¯b\overline{y}\neq b. Note that x¯b\overline{x}b is nonremovable in HH. Recalling |Z¯A|=1|\overline{Z}\cap A|=1, we have |NG(b)|=2|N_{G}(b)|=2, contradicting the assumption that GG is a brick. Now we consider the case when y¯=b\overline{y}=b. It can be checked that ZBZ\cap B is also a barrier of GG by symmetry. So |ZB|=1|Z\cap B|=1. Let {b}=ZB\{b^{\prime}\}=Z\cap B. Similar to the case when y¯b\overline{y}\neq b, we have |NH(b)|=2|N_{H}(b^{\prime})|=2, and so |V(H)|=4|V(H)|=4. In GG, assume that ee is the corresponding edge of the edge x¯y¯\overline{x}\,\overline{y}. Then the end of ee in X¯\overline{X} and bb^{\prime} is a 2-vertex cut of GG, contracting the fact that GG is a brick. ∎

Lemma 3.13.

Assume that (X)\partial(X) and (Y)\partial(Y) are two cuts of a brick GG such that G/XG/{X} and G/YG/{Y} are bricks, and (G/(X¯x¯))/(Y¯y¯)(G/(\overline{X}\rightarrow\overline{x}))/(\overline{Y}\rightarrow\overline{y}) is a matching covered bipartite graph HH. If G/(Xx)G/(X\rightarrow x) is an odd wheel such that xx is its hub and |NH(x¯)|2|N_{H}(\overline{x})|\geq 2, then there exists a removable edge ee of GG such that both ends of ee belong to X¯N(X¯)Y¯\overline{X}\cup N(\overline{X})\setminus\overline{Y}.

Proof.

Let G=G/(Xx)G^{\prime}=G/(X\rightarrow x). As xx is the hub of GG^{\prime}, every edge of (x)\partial(x) lies in some removable class. Note that |NH(x¯)|2|N_{H}(\overline{x})|\geq 2. Assume that x¯b\overline{x}b is an edge of (x¯)\partial(\overline{x}) in HH where by¯b\neq\overline{y}, and θ(x¯b)\theta(\overline{x}b) is the edge in GG^{\prime} corresponding to x¯b\overline{x}b. Then x¯b\overline{x}b is removable in HH by Lemma 3.12. If θ(x¯b)\theta(\overline{x}b) is removable in GG^{\prime}, then x¯b\overline{x}b is also removable in G/Y¯G/\overline{Y} by Lemma 2.9 as G/Y¯=G(x)H(x¯)G/\overline{Y}=G^{\prime}(x)\odot H(\overline{x}). Since x¯b(y¯)\overline{x}b\notin\partial(\overline{y}), x¯b\overline{x}b is removable in GG by Lemma 2.9 again. Moreover, the ends of x¯b\overline{x}b belong to X¯N(X¯)Y¯\overline{X}\cup N(\overline{X})\setminus\overline{Y}. The result follows by setting e=x¯be=\overline{x}b in this case. If θ(x¯b)\theta(\overline{x}b) is an edge of a removable doubleton in GG^{\prime}, assume that {e,θ(x¯b)}\{e^{\prime},\theta(\overline{x}b)\} is a removable doubleton in GG^{\prime}. Then ee^{\prime} is a removable edge in G/Y¯G/\overline{Y} by Theorem 2.10. So ee^{\prime} is removable in GG by Lemma 2.9 once more. As the ends of ee^{\prime} belong to X¯N(X¯)Y¯\overline{X}\cup N(\overline{X})\setminus\overline{Y}, the result follows by setting e=ee=e^{\prime}. ∎

4 Proof of Theorem 1.3

Let GG be a planar wheel-like brick. By Lemma 3.8, we only need to consider the case when GG contains no multiple edges. If GG is a near-bipartite brick, then GG is isomorphic to K4K_{4} by Lemma 3.3. Now we consider that GG is not a near-bipartite brick. We will prove this by induction on |V(G)||V(G)|. If |V(G)|=6|V(G)|=6, then GG is W5W_{5} by Proposition 3.6. The result follows. So we assume that the result holds for all the bricks with less than n(>6)n(>6) vertices, where nn is even. We now assume that |V(G)|=n|V(G)|=n. If GG is a solid brick, then GG is an odd wheel by Theorem 2.8. The theorem holds. So we consider the case when GG is a nonsolid brick. Then GG has a robust cut by Theorem 2.5. Let (Z)\partial(Z) be a robust cut of GG such that G1=G/(Zz)G_{1}=G/(Z\rightarrow z) and G2=G/(Z¯z¯)G_{2}=G/(\overline{Z}\rightarrow\overline{z}) are near-bricks. Since GG is planar, both G1G_{1} and G2G_{2} are planar by Lemma 3.5.

We assume firstly that both of G1G_{1} and G2G_{2} are bricks. Recall that GG is wheel-like. Then at least one of G1G_{1} and G2G_{2}, say G1G_{1}, is wheel-like and zz is its hub by Lemma 3.9. By the induction hypothesis, G1G_{1} is an odd wheel. Then every edge of (z)\partial(z) lies in some removable class of G1G_{1}. By Lemma 3.9, G2G_{2} is wheel-like. By the induction hypothesis, G2G_{2} is an odd wheel. By Lemmas 3.10 and 3.11, the wheel-like brick GG is nonplanar, a contradiction.

Now we assume that at least one of G1G_{1} and G2G_{2} is not a brick. Then there are two cuts, say (X)\partial(X) and (Y)\partial(Y), of GG such that G/(X¯x¯)/(Y¯y¯)G/(\overline{X}\rightarrow\overline{x})/(\overline{Y}\rightarrow\overline{y}) is a bipartite matching covered graph HH, and G=G/(Xx)G^{\prime}=G/(X\rightarrow x) and G′′=G/(Yy)G^{\prime\prime}=G/(Y\rightarrow y) are bricks by Theorem 2.6.

Claim 1. GG^{\prime} and G′′G^{\prime\prime} are wheel-like.

Proof.

Similar to the proof of 1) of Lemma 3.9 (with GG^{\prime} and G′′G^{\prime\prime} in place of G1G_{1} and G2G_{2}, respectively), we have at least one of GG^{\prime} and G′′G^{\prime\prime} is wheel-like, such that xx or yy is its hub.

Without loss of generality, we assume that GG^{\prime} is wheel-like and xx is its hub. By Lemma 3.5, GG^{\prime} is planar. So GG^{\prime} is an odd wheel by the induction hypothesis. Suppose that G′′G^{\prime\prime} is not wheel-like. Then there is a removable class R3R_{3} in G′′G^{\prime\prime} such that R3(y)=R_{3}\cap\partial(y)=\emptyset. By Lemma 2.9 and Theorem 2.10, R3R_{3} contains a removable edge e0e_{0} in GG. Suppose that |NH(x¯)|2|N_{H}(\overline{x})|\geq 2. By Lemma 3.13, there exists a removable edge ee in GG such that both ends of ee belong to X¯N(X¯)Y¯\overline{X}\cup N(\overline{X})\setminus\overline{Y}. So ee and e0e_{0} are two nonadjacent removable edges in GG, contradicting the assumption that GG is wheel-like. Therefore, we have |NH(x¯)|=1|N_{H}(\overline{x})|=1. As HH is matching covered, |V(H)|=2|V(H)|=2 and V(H)={x¯,y¯}V(H)=\{\overline{x},\overline{y}\}. So GG is isomorphic to G(x)G′′(y)G^{\prime}(x)\odot G^{\prime\prime}(y). Recalling that GG^{\prime} is an odd wheel, every edge of (x)\partial(x) lies in some removable class of GG^{\prime}. By Lemma 3.9, G′′G^{\prime\prime} is wheel-like since GG is wheel-like. ∎

By Lemma 3.5, GG^{\prime} and G′′G^{\prime\prime} are planar. So GG^{\prime} and G′′G^{\prime\prime} are odd wheels by the induction hypothesis and Claim 1. Assume that uhu_{h} and vhv_{h} are the hubs of GG^{\prime} and G′′G^{\prime\prime}, respectively. Let NG′′(vh)={v1,,vk}N_{G^{\prime\prime}}(v_{h})=\{v_{1},\ldots,v_{k}\}. By the proof of Claim 1, without loss of generality, assume that x=uhx=u_{h}. Moreover, we have the following claim.

Claim 2. V(H)={x¯,y¯}V(H)=\{\overline{x},\overline{y}\}.

Proof.

Suppose, to the contrary, that |NH(x¯)|2|N_{H}(\overline{x})|\geq 2. By Lemma 3.13, there exists a removable edge e1e_{1} in GG such that both ends of e1e_{1} belong to X¯N(X¯)Y¯\overline{X}\cup N(\overline{X})\setminus\overline{Y}. If y=viy=v_{i} (i{1,,k})(i\in\{1,\ldots,k\}), then every edge of (vh)\E[vi,vh]\partial(v_{h})\backslash E[v_{i},v_{h}] is a removable class RR in G′′G^{\prime\prime}. Note that R(y)=R\cap\partial(y)=\emptyset. If RR is a removable edge, then RR is also a removable edge in GG by Lemma 2.9, and if RR is a removable doubleton, then one edge of RR is also removable in GG by Theorem 2.10. So there exists an edge e2e_{2} that is removable in GG and both ends of e2e_{2} belong to Y¯\overline{Y}. Therefore, e1e_{1} and e2e_{2} are two nonadjacent removable edges in GG, contradicting the assumption that GG is wheel-like. So y=vhy=v_{h}. Suppose that |NH(y¯)|2|N_{H}(\overline{y})|\geq 2. Then there exists an edge e3e_{3} that is removable in GG and both ends of e3e_{3} belong to Y¯N(Y¯)X¯\overline{Y}\cup N(\overline{Y})\setminus\overline{X} by Lemma 3.13. So e1e_{1} and e3e_{3} are two nonadjacent removable edges in GG, a contradiction. Therefore, we have |NH(y¯)|=1|N_{H}(\overline{y})|=1. Since HH is matching covered, it is connected. Then NH(y¯)={x¯}N_{H}(\overline{y})=\{\overline{x}\}, that is V(H)={x¯,y¯}V(H)=\{\overline{x},\overline{y}\}.∎

By Claim 2, G(x)G′′(y)G^{\prime}(x)\odot G^{\prime\prime}(y) is isomorphic to GG. Recall that GG^{\prime} and G′′G^{\prime\prime} are odd wheels. By Lemma 3.11, the graph GG 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.