Small Cycle Cover of 2-Connected Cubic Graphs
|
|
- Jonathan Lindsey
- 6 years ago
- Views:
Transcription
1 . Small Cycle Cover of 2-Connected Cubic Graphs Hong-Jian Lai and Xiangwen Li 1 Department of Mathematics West Virginia University, Morgantown WV Abstract Every 2-connected simple cubic graph of order n 6 has a cycle cover with at most n cycles. This bound is best possible. 1. Introduction Graphs considered in this note are finite and undirected graphs. Undefined terms and notation can be found in [3]. The ceiling of a number x, denoted by x, is the smallest integer that is not less than x. A cycle cover of a graph G is a collection C of cycles of G such that every edge of G lies in at least one member of C. A cycle double cover of G is a cycle cover C of G such that each edge of G lies in exactly two members of C. The cycle double conjecture ([7], [6], and [8]) states that every bridgeless graph has a cycle double cover. It is known that if the cycle double cover conjecture is false, then a minimal counterexample would be a 2-edge-connected simple cubic graph. Bondy [2] conjectured that every 2-connected simple cubic graph on n vertices admits a double cycle cover C with C n 2. Bondy [2] also conjectured that if G is a 2-connected simple graph with n 3 vertices, then the edges of G can be covered by at most 2n 3 3 cycles. Earlier, Y. X. Luo and R. S. Chen [5] proved that this conjecture holds for 2-connected simple cubic graphs. Recently Fan [] proved this conjecture by showing that it holds for all simple 2-connected graphs. Barnette [1] proved that if G is a 3-connected simple planar graph of order n, then the edges of G can be covered by at most n+1 2 cycles. In this note, the following is proved. 1 Present address is Department of Mathematics and Statistics, University of Regina, Canada, SS 0A2 1
2 Theorem 1.1 Every 2-connected simple cubic graph of order n 6 admits a cycle cover C with C n. The result of Theorem 1.1 is sharp in the sense that there exists an infinite family of 2-connected cubic graphs such that each graph G in the family requires at least cycles in any cycle cover of G (see Figure 1). V (G) Let L 1, L 2 be two graphs isomorphic to K e, i.e. K minus an edge. Let G denote the graph in Figure 1. Note that n = V (G) = 2µ + 8. Since a cycle of G contains at most 2 edges in {e 1, e 2,..., e µ }, and since it takes at least 2 cycles to cover E(L 1 ) E(L 2 ), it follows that any cycle cover of G must have at least µ = n cycles L 1 e 1 e 2 e µ 1 e µ L Figure 1 2. Lemmas Let G be a 2-connected simple cubic graph and let T = {u 1, u 2, u 3 } be a 3-cut of G. If there is no vertex v V (G) such that N(v) = T, T is called a nontrivial 3-cut. Similarly we can define nontrivial 3-edge cut of G. A set of subgraphs of G is said to be independent if no two of them have a common vertex. The removal of an edge e = uv in a cubic graph G with N(u) = {x 1, y 1, v} and N(v) = {x 2, y 2, u} is to remove e and to replace the paths x 1 uy 1 and x 2 vy 2 by the edges x 1 y 1 and x 2 y 2 respectively. Denote by (G e) the resulting graph. Note that when G is a simple graph, (G e) may be not a simple graph. The following lemma is straightforward. Lemma 2.1 Let G be a simple cubic graph. Then (i) G is k-edge-connected if and only if G is k-connected, where 1 k 3. (ii) Suppose that G is a 3-connected graph of order n 6. Then G does not contain two distinct triangles T and T such that E(T ) E(T ). 2
3 Lemma 2.2 Let G be a 3-connected simple cubic graph of order n > and let T = x 1 x 2 x 3 x 1 be a triangle of G and let y i be the neighbor of x i for 1 i 3 such that {y 1, y 2, y 3 } V (T ) =. Suppose that T is contracted into one vertex x and that G is the resulting graph. If G has a cycle cover C, then G has a cycle cover C such that C = C. Proof. By Lemma 2.1 (ii), all triangles of G must be independent. Since G is 3-connected and cubic, it follows that G is a 3-connected cubic graph with V (G ) = V (G) 2. Let C 1, C 2 and C 3 denote the sets of cycles in C containing the paths y 1 xy 2, y 1 xy 3 and y 2 xy 3, respectively. Now replace the paths y 1 xy 2, y 1 xy 3 and y 2 xy 3 on all cycles containing them by the paths y 1 x 1 x 3 x 2 y 2, y 1 x 1 x 2 x 3 y 3 and y 2 x 2 x 1 x 3 y 3, respectively. Since C is a cycle cover of G, at least two of C 1, C 2, C 3 are nonempty. It follows that all edges of T can be covered by the modified cycles. These modified cycles, together with the unmodified cycles, form a cycle cover C of G with C = C. A graph G is essentially -edge-connected if it is 3-edge-connected and, if G S is disconnected for some set S of three edges of G, then G S has exactly two components, one of which is a single vertex. It follows that if G is a 3-connected cubic graph and G does not contain any nontrivial 3-edge cuts, then G is essentially -edge-connected. Lemma 2.3 Let G be a triangle free simple cubic graph. Then (i) Suppose that G is a 3-edge-connected graph and e E(G). 2-connected simple cubic graph. Then (G e) is a (ii) Suppose that G is an essentially -edge-connected graph and e E(G). (G e) is a 3-connected simple cubic graph. Proof. Then (i) By the assumption that G is a 3-edge-connected triangle free simple cubic graph, V (G) 8. Let e = uv E(G) and N(u) = {z 1, z 2, v} and N(v) = {w 1, w 2, u}. Since G is triangle free, z 1 z 2 / E(G), w 1 w 2 / E(G) and {z 1, z 2 } {w 1, w 2 } =. Since G is 3-edge-connected, (G e) is a connected simple cubic graph. Assume that e is an edge cut of (G e). Then {e, e} is an edge cut of G, contrary to the assumption that κ (G) 3. (ii) Let T = {e 1, e 2,..., e k } be a minimum nontrivial edge cut of G containing e = e 1, k. By (i), (G e 1 ) is a 2-connected simple cubic graph. We claim that (G e 1 ) is a 3-connected simple cubic graph. By contradiction, assume that (G e 1 ) has a 2-edge cut {e 1, e 2 }. Then G has an edge cut T {e 1, e 1, e 2 }. Since G is essentially -edge-connected, T = {e 1, e 1, e 2 } and there is a vertex w such that w is 3
4 an end of all edges of e 1, e 1 and e 2. On the other hand, by the definition of (G e 1), e 1, e 2 / E(G e 1), a contradiction. 3. Proof of Theorem 1.1 We argue by induction on n = V (G). As G is cubic, V (G) is even. When n = 6, G is one of the two graphs in Figure 2. It is easy to verify that each of G 1 and G 2 has a cycle cover C with C = 2. G 1 G 2 Figure 2: G 1 and G 2 Now we assume that n 8. Consider the following three cases. Case 1 G has a 2-cut {u, v} such that uv E(G). Then G has two vertex disjoint subgraphs G 1 and G 2 with nonadjacent vertices x i, y i V (G i ), (1 i 2), and a ladder G 3 whose ends are x 1, y 1, x 2 and y 2, such that E(G) = E(G 1 ) E(G 2 ) E(G 3 ), as shown in Figure 3. x 1 u 1 u 2 u µ 2 u µ 1 u µ x 2 G 1 G 2 y v 1 v 2 v µ 2 v µ 1 v µ y 2 Figure 3: The Graph G in the Proof for Case 1
5 Let u 1, v 1, u µ, v µ V (G 3 ) with x 1 u 1, y 1 v 1, x 2 u µ, y 2 v µ E(G). We define the three graphs G 1, G 2 and G 3 from G as follows: G i = G i +x i y i, i = 1, 2 and G 3 = G V (G 1 G 2 ). Let V (G i ) = n i, i = 1, 2, 3. It follows that n 1 + n 2 + n 3 = n, that both G 1 and G 2 are two 2-connected simple cubic graphs and that both n 1 and n 2 are even. By induction, for each i = 1, 2, if G = i K, then G i has a cycle cover C i with C i n i. We will distinguish the following subcases. Subcase 1.1 G i = K, i = 1, 2. Suppose first that µ = 1. On those cycles of C 1 containing x 1 y 1, replace x 1 y 1 by the path x 1 u 1 v 1 y 1 and on those cycles of C 2 containing x 2 y 2, replace by the path x 2 u 1 v 1 y 2. The modified and unmodified cycles then form a cycle cover C of G with C = C 1 + C 2 n 1 + n 2 n. In the case µ 2, let C be one of the cycles of C 1 containing x 1 y 1 and let D be one of the cycles of C 2 containing x 2 y 2. On those cycles of C 1 containing x 1 y 1, replace x 1 y 1 by the paths x 1 u 1 u 2... u µ x 2, D x 2 y 2 and y 2 v µ v µ 1... v 1 y 1, juxtaposed in the obvious way. On the cycles of C 2 containing x 2 y 2 replace x 2 y 2 by the paths x 2 u µ u µ 1... u 1 x 1, C x 1 y 1 and y 1 v 1 v 2... v µ y 2. We now have C 1 + C 2 1 cycles (two of the modified cycles are identical) which together cover all edges of G except the rungs of the ladder, which can be covered by µ 2 cycles of length. Thus we have a cycle cover C of G with C = C 1 + C 2 1+ µ 2 n. Subcase 1.2 Exactly one of G 1 and G 2 is isomorphic to K. We may assume that G 1 = K, G 2 = K. Since G 1 = K, E(G 1 ) has a cycle cover C 1 = {C 1, C 2 } such that x 1 y 1 E(C 1 ) E(C 2 ). By induction, G 2 has a cycle cover C 2 with at most n 2 cycles. Let D be a cycle of C 2 containing x 2 y 2. In case µ = 1, replace x 1 y 1 on C 1 by the path x 1 u 1 v 1 y 1 and replace x 1 y 1 on C 2 by the paths x 1 u 1 x 2, D x 2 y 2 and y 2 v 1 y 1, juxtaposed in the obvious way. On those cycles of C 2 containing x 2 y 2 ( other than D) replace x 2 y 2 by the path y 2 v 1 u 1 x 2. The modified and unmodified cycles together form a cycle cover C of G satisfying C = C n n İn case µ 2, replace x 1y 1 on C 1 by the path x 1 u 1 v 1 y 1 and replace x 1 y 1 on C 2 by the paths x 1 u 1 u 2... u µ x 2, D x 2 y 2, y 2 v µ v µ 1... v 1 y 1. On those cycles of C 2 (other than D) that contain x 2 y 2, replace x 2 y 2 by the path x 2 u µ v µ y 2. The modified and unmodified cycles cover all edges of G except µ 1 rungs of the ladder, which can be covered by µ 1 2 cycles of length 5
6 . These results a cycle cover C of G such that C = C µ 1 2 n µ 1 2 n. Subcase 1.3 G i = K, i = 1, 2. Then G is the graph in Figure 1. It is easy to check that G has a cycle cover C with C n if n = 8 or n = 10. So we assume that n 12. It follows that µ 2. All edges of G except the rungs of the ladder can be covered by two cycles and the rungs of the ladder can be covered by µ 2 cycles of length. Thus G has a cycle cover C such that C = 2 + µ 2 = n. Case 2. G has a 2-cut {u, v} but Case 1 does not occur. Then G has an edge cut X with X = 2 such that G X is the disjoint union of two subgraphs G 1 and G 2, (see Figure ). Since Case 1 does not occur, we must have both x 1 y 1 / E(G) and x 2 y 2 / E(G). G 1 x 1 x 2 G 2 y 1 y 2 Figure : The structure of G in Case 2 For i = 1, 2, define G i = G i + x i y i, and let n i = V (G i ). Note that n = n 1 + n 2. By induction, if G i = K, then G i has a cycle covers C i with C i n i for i = 1, 2. Since n 8, we assume first that G i = K, i = 1, 2. Then G is the graph in Figure 5. It is easy to verify that G has a cycle cover C with C = 2. 6
7 Figure 5 We assume then that G 1 = K and G 2 = K. G 1 can be covered C = {C 1, C 2 } such that x 1 y 1 E(C 1 ) E(C 2 ). Let D 1 be a cycle of C 2 containing x 2 y 2. On those cycles of C 2 containing x 2 y 2, replace x 2 y 2 by the paths x 1 x 2, C 1 x 1 y 1 and y 1 y 2. On two cycles of C 1 containing x 1 y 1, replace x 1 y 1 by the paths x 1 x 2, D 1 x 2 y 2 and y 1 y 2. The modified and unmodified cycles together form a cycle cover C of G. Since two of the modified cycles are identical, C = C 1 + C n 2 1 = n. Finally we assume that G i = K, i = 1, 2. Let C be a cycle of C 1 containing x 1 y 1 and D a cycle of C 2 containing x 2 y 2. On those cycles of C 1 containing x 1 y 1, replace x 1 y 1 by the paths x 1 x 2, D x 2 y 2 and y 1 y 2. On those cycles of C 2 containing x 2 y 2, replace x 2 y 2 by the paths x 1 x 2, C x 1 y 1 and y 1 y 2. Thus the modified cycles and unmodified cycles form a cycle cover C of G. Since two of the modified cycles are identical, C = C 1 + C 2 1 n 1 + n 2 1 n. Case 3. κ(g) 3. By Lemmas 2.1 and 2.2, we may assume that G is triangle free. If n = 8, then G must be one of the two graphs in Figure 6. It is easy to verify that each of which has a cycle cover C with C = 2. Figure 6 We now assume that n 10. We will distinguish the following two subcases. Subcase 3.1 G has a nontrivial 3-cut. 7
8 Let T = {e 1, e 2, e 3 } be a nontrivial 3 edge cut of G. Since G is a triangle free simple cubic graph, G T has only two components and each component of G T has at least 5 vertices. Let H 1, H 2 be the components of G T and assume that for i = 1, 2, 3, e i = x i y i with x 1, x 2, x 3 V (H 1 ) and y 1, y 2, y 3 V (H 2 ). Let u and v be two new vertices not in V (G), let H1 = H 1 {x 1 u, x 2 u, x 3 u} and H2 = H 2 {y 1 v, y 2 v, y 3 v}, and let n i = V (Hi ), i = 1, 2. It follows that for i = 1, 2, H i is a 2-connected (in fact, 3-connected) simple cubic graph with n i 6 and Hi = K. Thus, by induction, Hi has a cycle cover C i with C i n i. Let C(1) 1, C(2) 1 and C (3) 1 denote the sets of cycles of C 1 containing the paths x 1 ux 2, x 1 ux 3 and x 2 ux 3, respectively. Let C (1) 2, C(2) 2 and C (3) 2 denote the sets of cycles in C 2 containing the paths y 1 vy 2, y 1 vy 3 and y 2 vy 3, respectively. At least two of C (1) i, C (2) i and C (3) i are nonempty for each i = 1, 2. We may assume, without loss of generality, that C (3) 1 and C (3) 2 are nonempty. Let C (3) 1 C (3) 1 and C (3) 2 C (3) 2. Let P 1 be a path in H 1 joining x 1 and x 2 and Q 1 a path in H 1 joining x 1 and x 3. Let P 2 be a path in H 2 joining y 1 and y 2 and Q 2 a path in H 2 joining y 1 and y 3. Step 1. Modify the cycles in C 1 containing u as follows. From each cycle of C (1) 1 form a new cycle by deleting the path x 1 ux 2 and inserting the edges e 1 and e 2 and the path P 2. From each cycle of C (2) 1 form a new cycle by deleting the path x 1 ux 3 and inserting the edges e 1 and e 3 and the path Q 2. From each cycle of C (3) 1 form a new cycle by the deleting the path x 2 ux 3 and inserting the edges e 2 and e 3 and the path obtained from C (3) 2 by deleting y 2 vy 3. These modified cycles, together with the unmodified cycles of C 1 cover all edges of H 1, the edges e 1 e 2 and e 3 and some edges of H 2. Step 2. In exactly the same manner (with P 1, Q 1 and C (3) 1 playing the roles of P 2, Q 2 and C (3) 2 ) we modify all of the cycles of C 2 containing v. The resulting modified cycles, together with the unmodified cycles cover all of the edges of H 2 and some other edges. One of the modified cycles here is the same as one of those obtained in Step 1. These results a cycle cover C of G such that C = C 1 + C 2 1 n 1 + n 2 1 n. Subcase 3.2 G has no nontrivial 3-cut. graph. By Lemma 2.3, there is an edge e 1 such that (G e 1 ) is a 3-connected simple cubic Suppose first that (G e 1 ) contains a triangle T. Let G 1 be the graph obtained from (G e 1 ) by contracting T. It follows that G 1 is a 2-connected simple cubic graph. By induction, G 1 has a cycle cover C with C n. By Lemma 2.2 (G e 1) has a cycle cover C with C = C n. Since G is 3-connected, there is a cycle containing the 8
9 edge e 1. Therefore G has a cycle cover C with C + 1 n + 1 n. We then assume that (G e 1 ) is triangle free. Let e 1 = u 1 v 1, N(u 1 ) = {x 1, y 1, v 1 } and N(v 1 ) = {x 2, y 2, u 1 }. Then x 1 y 1, x 2 y 2 E((G e 1 ) ). Claim. (G e 1 ) contains an edge e 2 = u 2 v 2 such that {u 2, v 2 } {x 1, y 1, x 2, y 2 } =. Proof. Since G is triangle free, x 1, x 2, y 1, y 2 are four distinct vertices. Thus x 1 y 1 is independent of x 2 y 2. Since (G e 1 ) is 3-edge-connected, there is a cycle containing both x 1 y 1 and x 2 y 2. Let T be the minimal edge cut of (G e 1 ) which contains both x 1 y 1 and x 2 y 2. It follows that (G e 1 ) T contains only two connected components H 1 and H 2. Since (G e 1 ) is 3-edge-connected, there is an edge e = x 3 y 3 T {x 1 y 1, x 2 y 2 }. Without loss of generality, we assume that x 1, x 2, x 3 V (H 1 ) and y 1, y 2, y 3 V (H 2 ). If x 3 / {x 1, x 2 } and y 3 / {y 1, y 2 }, then e 2 = e is a desired edge. We now assume, without loss of generality, that y 1 = y 3. Then x 1 x 3. Suppose that x 3 = x 2. Since (G e 1 ) is a 3-edge-connected simple graph, let z 3 be a vertex such that z 3 y 3 E(G) and z 3 / {x 1, x 2 }. Since (G e 1 ) is cubic and simple, z 3 has two neighbors z 1, z 2 such that y 3 / {z 1, z 2 }. Since (G e 1 ) is triangle free, {z 1, z 2 } {x 1, x 3 } =. We assume, without loss of generality, that z 1 y 2. Then e 2 = z 1 z 3 is a desired edge. Now we assume that x 3 x 2. Observe the vertex x 3. Let a 1 and a 2 be two neighbors of x 3 such that y 3 / {a 1, a 2 }. Since (G e 1 ) is triangle free, x 1 / {a 1, a 2 } and {a 1, a 2 } {x 2, y 2 } 1. Without loss of generality, we assume that a 1 / {x 2, y 2 }. Then the edge a 1 x 3 is a desired edge. By Claim and by Lemma 2.3, ((G e 1 ) e 2 ) is a 2-connected simple cubic graph. Let N(u 2 ) = {s 1, t 1, v 2 }, N(v 2 ) = {s 2, t 2, u 2 } ( Note that {s 1, t 1, s 2, t 2 } {x 1, y 1, x 2, y 2 } can be not empty). Let G = ((G e 1 ) e 2 ). Since V (G ) = n 6, by induction, G has a cycle cover C 1 such that C 1 n. Replace the edges s 1 t 1 and s 2 t 2 on any cycles of C 1 containing them by the paths s 1 u 2 t 1 and s 2 v 2 t 2 respectively. Let C be the set of all modified and unmodified cycles of C 1. Then all edges of (G e 1 ) except e 1 lie in at least one member of C. Replace the edges x 1 y 1 and x 2 y 2 on any cycles of C containing them by the paths x 1 u 1 y 1 and x 2 v 1 y 2 respectively. Then the modified and unmodified cycles of C cover all edges of G except e 1 and e 2. Since G is 3-connected, there is a cycle in G containing e 1 and e 2, and so G has a cycle cover C of G such that C = C n + 1 n. This completes the proof of Theorem
10 Acknowledgments The authors would like to thank the referees for their valuable comments and suggestions which improved the presentation. References [1] D. W. Barnette, Cycle covers of planar 3-connected graphs, J. of Combin. Math and Combin. Computing, 20 (1996), [2] J.A. Bondy, Small cycle double covers of graphs, Cycles and Rays, Kluwer Academic Publishers, Dordecht, 1990, [3] J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, American Elsevier, New York, (1976). [] G. Fan, Subgraph covering and edge switchings, J. Combin. Theory, Ser. B (8) (2002) [5] Y. X. Luo and R. S. Chen, Cycle covers of 2-connected 3-regular graphs, (Chinese, Chinese summary), Math. Appl. 9 (1996), suppl., [6] P. D. Seymour, Sums of circuits, in: J. A. Bondy and U. S. R. Murty, eds., Graph Theory and Related Topics, Academic Press, New York, (1979), [7] G. Szekeres, Polyhedral decomposition of cubic graphs, Bull. Austral. Math. Soc., 8, (1973), [8] C. Q. Zhang, Integer Flows and Cycle Covers of Graphs, Marcel Dekker, Inc., New York, (1997). 10
Supereulerian planar graphs
Supereulerian planar graphs Hong-Jian Lai and Mingquan Zhan Department of Mathematics West Virginia University, Morgantown, WV 26506, USA Deying Li and Jingzhong Mao Department of Mathematics Central China
More informationEvery line graph of a 4-edge-connected graph is Z 3 -connected
European Journal of Combinatorics 0 (2009) 595 601 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Every line graph of a 4-edge-connected
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationCycle Double Cover Conjecture
Cycle Double Cover Conjecture Paul Clarke St. Paul's College Raheny January 5 th 2014 Abstract In this paper, a proof of the cycle double cover conjecture is presented. The cycle double cover conjecture
More informationDegree Sequence and Supereulerian Graphs
Degree Sequence and Supereulerian Graphs Suohai Fan, Hong-Jian Lai, Yehong Shao, Taoye Zhang and Ju Zhou January 29, 2007 Abstract A sequence d = (d 1, d 2,, d n ) is graphic if there is a simple graph
More informationCycle Double Covers and Semi-Kotzig Frame
Cycle Double Covers and Semi-Kotzig Frame Dong Ye and Cun-Quan Zhang arxiv:1105.5190v1 [math.co] 26 May 2011 Department of Mathematics, West Virginia University, Morgantown, WV 26506-6310 Emails: dye@math.wvu.edu;
More informationEulerian Subgraphs in Graphs with Short Cycles
Eulerian Subgraphs in Graphs with Short Cycles Paul A. Catlin Hong-Jian Lai Abstract P. Paulraja recently showed that if every edge of a graph G lies in a cycle of length at most 5 and if G has no induced
More informationRegular matroids without disjoint circuits
Regular matroids without disjoint circuits Suohai Fan, Hong-Jian Lai, Yehong Shao, Hehui Wu and Ju Zhou June 29, 2006 Abstract A cosimple regular matroid M does not have disjoint circuits if and only if
More informationEulerian Subgraphs and Hamilton-Connected Line Graphs
Eulerian Subgraphs and Hamilton-Connected Line Graphs Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 2606, USA Dengxin Li Department of Mathematics Chongqing Technology
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationHamilton weight and Petersen minor
Hamilton weight and Petersen minor Hong-Jian Lai and Cun-Quan Zhang Department of Mathematics West Virginia University Morgantown, WV 26506-6310, USA Email: hjlai@math.wvu.edu, cqzhang@math.wvu.edu Abstract
More informationGraphs and Combinatorics
Graphs and Combinatorics (2005) 21:469 474 Digital Object Identifier (DOI) 10.1007/s00373-005-0625-0 Graphs and Combinatorics Springer-Verlag 2005 On Group Chromatic Number of Graphs Hong-Jian Lai 1 and
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More informationEvery 3-connected, essentially 11-connected line graph is hamiltonian
Every 3-connected, essentially 11-connected line graph is hamiltonian Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou October 2, 25 Abstract Thomassen conjectured that every 4-connected line graph is hamiltonian.
More informationThe Reduction of Graph Families Closed under Contraction
The Reduction of Graph Families Closed under Contraction Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 November 24, 2004 Abstract Let S be a family of graphs. Suppose
More informationand critical partial Latin squares.
Nowhere-zero 4-flows, simultaneous edge-colorings, and critical partial Latin squares Rong Luo Department of Mathematical Sciences Middle Tennessee State University Murfreesboro, TN 37132, U.S.A luor@math.wvu.edu
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationUpper Bounds of Dynamic Chromatic Number
Upper Bounds of Dynamic Chromatic Number Hong-Jian Lai, Bruce Montgomery and Hoifung Poon Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 June 22, 2000 Abstract A proper vertex
More informationThe Chvátal-Erdős condition for supereulerian graphs and the hamiltonian index
The Chvátal-Erdős condition for supereulerian graphs and the hamiltonian index Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 6506, U.S.A. Huiya Yan Department of Mathematics
More informationNowhere-zero 3-flows in triangularly connected graphs
Nowhere-zero 3-flows in triangularly connected graphs Genghua Fan 1, Hongjian Lai 2, Rui Xu 3, Cun-Quan Zhang 2, Chuixiang Zhou 4 1 Center for Discrete Mathematics Fuzhou University Fuzhou, Fujian 350002,
More informationOn Brooks Coloring Theorem
On Brooks Coloring Theorem Hong-Jian Lai, Xiangwen Li, Gexin Yu Department of Mathematics West Virginia University Morgantown, WV, 26505 Abstract Let G be a connected finite simple graph. δ(g), (G) and
More informationHamiltonian claw-free graphs
Hamiltonian claw-free graphs Hong-Jian Lai, Yehong Shao, Ju Zhou and Hehui Wu August 30, 2005 Abstract A graph is claw-free if it does not have an induced subgraph isomorphic to a K 1,3. In this paper,
More informationHamilton-Connected Indices of Graphs
Hamilton-Connected Indices of Graphs Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan and Mingquan Zhan Abstract Let G be an undirected graph that is neither a path nor a cycle. Clark and Wormald
More informationOn colorability of graphs with forbidden minors along paths and circuits
On colorability of graphs with forbidden minors along paths and circuits Elad Horev horevel@cs.bgu.ac.il Department of Computer Science Ben-Gurion University of the Negev Beer-Sheva 84105, Israel Abstract.
More informationOn two conjectures about the proper connection number of graphs
On two conjectures about the proper connection number of graphs Fei Huang, Xueliang Li, Zhongmei Qin Center for Combinatorics and LPMC arxiv:1602.07163v3 [math.co] 28 Mar 2016 Nankai University, Tianjin
More informationDecomposing planar cubic graphs
Decomposing planar cubic graphs Arthur Hoffmann-Ostenhof Tomáš Kaiser Kenta Ozeki Abstract The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree,
More informationConditional colorings of graphs
Discrete Mathematics 306 (2006) 1997 2004 Note Conditional colorings of graphs www.elsevier.com/locate/disc Hong-Jian Lai a,d, Jianliang Lin b, Bruce Montgomery a, Taozhi Shui b, Suohai Fan c a Department
More informationLine Graphs and Forbidden Induced Subgraphs
Line Graphs and Forbidden Induced Subgraphs Hong-Jian Lai and Ľubomír Šoltés Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 July 14, 2002 Abstract Beineke and Robertson independently
More informationExtendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations
Graphs and Combinatorics (2016) 32:1065 1075 DOI 10.1007/s00373-015-1636-0 ORIGINAL PAPER Extendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations Yanting Liang 1 Hong-Jian
More informationA characterization of diameter-2-critical graphs with no antihole of length four
Cent. Eur. J. Math. 10(3) 2012 1125-1132 DOI: 10.2478/s11533-012-0022-x Central European Journal of Mathematics A characterization of diameter-2-critical graphs with no antihole of length four Research
More informationEvery 3-connected, essentially 11-connected line graph is Hamiltonian
Journal of Combinatorial Theory, Series B 96 (26) 571 576 www.elsevier.com/locate/jctb Every 3-connected, essentially 11-connected line graph is Hamiltonian Hong-Jian Lai a, Yehong Shao b, Hehui Wu a,
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationarxiv: v1 [math.co] 28 Oct 2016
More on foxes arxiv:1610.09093v1 [math.co] 8 Oct 016 Matthias Kriesell Abstract Jens M. Schmidt An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting
More informationGraph homomorphism into an odd cycle
Graph homomorphism into an odd cycle Hong-Jian Lai West Virginia University, Morgantown, WV 26506 EMAIL: hjlai@math.wvu.edu Bolian Liu South China Normal University, Guangzhou, P. R. China EMAIL: liubl@hsut.scun.edu.cn
More informationCycles in 4-Connected Planar Graphs
Cycles in 4-Connected Planar Graphs Guantao Chen Department of Mathematics & Statistics Georgia State University Atlanta, GA 30303 matgcc@panther.gsu.edu Genghua Fan Institute of Systems Science Chinese
More informationGroup Colorability of Graphs
Group Colorability of Graphs Hong-Jian Lai, Xiankun Zhang Department of Mathematics West Virginia University, Morgantown, WV26505 July 10, 2004 Abstract Let G = (V, E) be a graph and A a non-trivial Abelian
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationEvery 4-connected line graph of a quasi claw-free graph is hamiltonian connected
Discrete Mathematics 308 (2008) 532 536 www.elsevier.com/locate/disc Note Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected Hong-Jian Lai a, Yehong Shao b, Mingquan Zhan
More informationZero-Sum Flows in Regular Graphs
Zero-Sum Flows in Regular Graphs S. Akbari,5, A. Daemi 2, O. Hatami, A. Javanmard 3, A. Mehrabian 4 Department of Mathematical Sciences Sharif University of Technology Tehran, Iran 2 Department of Mathematics
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationPath decompositions and Gallai s conjecture
Journal of Combinatorial Theory, Series B 93 (005) 117 15 www.elsevier.com/locate/jctb Path decompositions and Gallai s conjecture Genghua Fan Department of Mathematics, Fuzhou University, Fuzhou, Fujian
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H 1, H 2 ) so that H 1 H 2 = G E(H 1 ) E(H 2 ) = V (H 1 ) V (H 2 ) = k Such a separation is proper if V (H
More informationResearch Article Dicycle Cover of Hamiltonian Oriented Graphs
Discrete Mathematics Volume 2016, Article ID 7942192, 5 pages http://dxdoiorg/101155/2016/7942192 Research Article Dicycle Cover of Hamiltonian Oriented Graphs Khalid A Alsatami, 1 Hong-Jian Lai, 2 and
More informationHamilton cycles and closed trails in iterated line graphs
Hamilton cycles and closed trails in iterated line graphs Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 USA Iqbalunnisa, Ramanujan Institute University of Madras, Madras
More informationLongest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs Gregory Gutin Department of Mathematical Sciences Brunel, The University of West London Uxbridge, Middlesex,
More informationStrongly 2-connected orientations of graphs
Downloaded from orbit.dtu.dk on: Jul 04, 2018 Strongly 2-connected orientations of graphs Thomassen, Carsten Published in: Journal of Combinatorial Theory. Series B Link to article, DOI: 10.1016/j.jctb.2014.07.004
More informationarxiv: v2 [math.co] 7 Jan 2016
Global Cycle Properties in Locally Isometric Graphs arxiv:1506.03310v2 [math.co] 7 Jan 2016 Adam Borchert, Skylar Nicol, Ortrud R. Oellermann Department of Mathematics and Statistics University of Winnipeg,
More informationNowhere-zero Unoriented Flows in Hamiltonian Graphs
Nowhere-zero Unoriented Flows in Hamiltonian Graphs S. Akbari 1,5, A. Daemi 2, O. Hatami 1, A. Javanmard 3, A. Mehrabian 4 1 Department of Mathematical Sciences Sharif University of Technology Tehran,
More informationON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS
Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,
More informationCompatible Circuit Decompositions of 4-Regular Graphs
Compatible Circuit Decompositions of 4-Regular Graphs Herbert Fleischner, François Genest and Bill Jackson Abstract A transition system T of an Eulerian graph G is a family of partitions of the edges incident
More informationSpanning Paths in Infinite Planar Graphs
Spanning Paths in Infinite Planar Graphs Nathaniel Dean AT&T, ROOM 2C-415 600 MOUNTAIN AVENUE MURRAY HILL, NEW JERSEY 07974-0636, USA Robin Thomas* Xingxing Yu SCHOOL OF MATHEMATICS GEORGIA INSTITUTE OF
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationCharacterizing binary matroids with no P 9 -minor
1 2 Characterizing binary matroids with no P 9 -minor Guoli Ding 1 and Haidong Wu 2 1. Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana, USA Email: ding@math.lsu.edu 2. Department
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
More informationCographs; chordal graphs and tree decompositions
Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs
More informationCompatible Circuit Decompositions of Eulerian Graphs
Compatible Circuit Decompositions of Eulerian Graphs Herbert Fleischner, François Genest and Bill Jackson Septemeber 5, 2006 1 Introduction Let G = (V, E) be an Eulerian graph. Given a bipartition (X,
More informationarxiv: v1 [cs.dm] 24 Jan 2008
5-cycles and the Petersen graph arxiv:0801.3714v1 [cs.dm] 24 Jan 2008 M. DeVos, V. V. Mkrtchyan, S. S. Petrosyan, Department of Mathematics, Simon Fraser University, Canada Department of Informatics and
More informationAn approximate version of Hadwiger s conjecture for claw-free graphs
An approximate version of Hadwiger s conjecture for claw-free graphs Maria Chudnovsky Columbia University, New York, NY 10027, USA and Alexandra Ovetsky Fradkin Princeton University, Princeton, NJ 08544,
More informationOn Perfect Matching Coverings and Even Subgraph Coverings
On Perfect Matching Coverings and Even Subgraph Coverings Xinmin Hou, Hong-Jian Lai, 2 and Cun-Quan Zhang 2 SCHOOL OF MATHEMATICAL SCIENCES UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA HEFEI, ANHUI, 20026
More informationGIRTH SIX CUBIC GRAPHS HAVE PETERSEN MINORS
GIRTH SIX CUBIC GRAPHS HAVE PETERSEN MINORS Neil Robertson 1 Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA P. D. Seymour Bellcore 445 South St. Morristown,
More informationON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2. Bert L. Hartnell
Discussiones Mathematicae Graph Theory 24 (2004 ) 389 402 ON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2 Bert L. Hartnell Saint Mary s University Halifax, Nova Scotia, Canada B3H 3C3 e-mail: bert.hartnell@smu.ca
More informationPerfect divisibility and 2-divisibility
Perfect divisibility and 2-divisibility Maria Chudnovsky Princeton University, Princeton, NJ 08544, USA Vaidy Sivaraman Binghamton University, Binghamton, NY 13902, USA April 20, 2017 Abstract A graph
More informationThe edge-density for K 2,t minors
The edge-density for K,t minors Maria Chudnovsky 1 Columbia University, New York, NY 1007 Bruce Reed McGill University, Montreal, QC Paul Seymour Princeton University, Princeton, NJ 08544 December 5 007;
More informationTHE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS
Discussiones Mathematicae Graph Theory 27 (2007) 507 526 THE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS Michael Ferrara Department of Theoretical and Applied Mathematics The University
More informationProper connection number and 2-proper connection number of a graph
Proper connection number and 2-proper connection number of a graph arxiv:1507.01426v2 [math.co] 10 Jul 2015 Fei Huang, Xueliang Li, Shujing Wang Center for Combinatorics and LPMC-TJKLC Nankai University,
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
More informationExtremal Graphs Having No Stable Cutsets
Extremal Graphs Having No Stable Cutsets Van Bang Le Institut für Informatik Universität Rostock Rostock, Germany le@informatik.uni-rostock.de Florian Pfender Department of Mathematics and Statistics University
More informationOn a Conjecture of Thomassen
On a Conjecture of Thomassen Michelle Delcourt Department of Mathematics University of Illinois Urbana, Illinois 61801, U.S.A. delcour2@illinois.edu Asaf Ferber Department of Mathematics Yale University,
More informationCIRCULAR CHROMATIC NUMBER AND GRAPH MINORS. Xuding Zhu 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 4, No. 4, pp. 643-660, December 2000 CIRCULAR CHROMATIC NUMBER AND GRAPH MINORS Xuding Zhu Abstract. This paper proves that for any integer n 4 and any rational number
More informationA Characterization of the Cactus Graphs with Equal Domination and Connected Domination Numbers
International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 7, 275-281 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.7932 A Characterization of the Cactus Graphs with
More informationCYCLE DOUBLE COVERS OF INFINITE PLANAR GRAPHS
Discussiones Mathematicae Graph Theory 36 (2016) 523 544 doi:10.7151/dmgt.1879 CYCLE DOUBLE COVERS OF INFINITE PLANAR GRAPHS Mohammad Javaheri 515 Loudon Road School of Science, Siena College Loudonville,
More informationNowhere-zero flows in signed series-parallel graphs arxiv: v1 [math.co] 6 Nov 2014
Nowhere-zero flows in signed series-parallel graphs arxiv:1411.1788v1 [math.co] 6 Nov 2014 Tomáš Kaiser 1,2 Edita Rollová 1,3 Abstract Bouchet conjectured in 1983 that each signed graph that admits a nowhere-zero
More informationEXCLUDING SUBDIVISIONS OF INFINITE CLIQUES. Neil Robertson* Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA
EXCLUDING SUBDIVISIONS OF INFINITE CLIQUES Neil Robertson* Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA P. D. Seymour Bellcore 445 South St. Morristown, New
More informationMinimizing the Laplacian eigenvalues for trees with given domination number
Linear Algebra and its Applications 419 2006) 648 655 www.elsevier.com/locate/laa Minimizing the Laplacian eigenvalues for trees with given domination number Lihua Feng a,b,, Guihai Yu a, Qiao Li b a School
More informationFine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles
Mathematics Publications Mathematics 2017 Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles Zdeněk Dvořák Charles University Bernard Lidicky
More informationDegree Sum Conditions and Vertex-Disjoint Cycles in a Graph
Degree Sum Conditions and Vertex-Disjoint Cycles in a Graph Shinya Fujita Hajime Matsumura Department of Mathematics Keio University Yokohama 223-8522, Japan shinyaa@comb.math.keio.ac.jp musimaru@comb.math.keio.ac.jp
More informationOn the Turán number of forests
On the Turán number of forests Bernard Lidický Hong Liu Cory Palmer April 13, 01 Abstract The Turán number of a graph H, ex(n, H, is the maximum number of edges in a graph on n vertices which does not
More informationOn the connectivity of the direct product of graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 41 (2008), Pages 45 56 On the connectivity of the direct product of graphs Boštjan Brešar University of Maribor, FEECS Smetanova 17, 2000 Maribor Slovenia bostjan.bresar@uni-mb.si
More informationA zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees
Downloaded from orbit.dtu.dk on: Sep 02, 2018 A zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees Perrett, Thomas Published in: Discrete Mathematics Link to article, DOI:
More informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
More informationarxiv: v1 [math.co] 28 Oct 2015
Noname manuscript No. (will be inserted by the editor) A note on the Ramsey number of even wheels versus stars Sh. Haghi H. R. Maimani arxiv:1510.08488v1 [math.co] 28 Oct 2015 Received: date / Accepted:
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationSpanning cycles in regular matroids without M (K 5 ) minors
Spanning cycles in regular matroids without M (K 5 ) minors Hong-Jian Lai, Bolian Liu, Yan Liu, Yehong Shao Abstract Catlin and Jaeger proved that the cycle matroid of a 4-edge-connected graph has a spanning
More informationThe Restricted Edge-Connectivity of Kautz Undirected Graphs
The Restricted Edge-Connectivity of Kautz Undirected Graphs Ying-Mei Fan College of Mathematics and Information Science Guangxi University, Nanning, Guangxi, 530004, China Jun-Ming Xu Min Lü Department
More informationMINIMALLY NON-PFAFFIAN GRAPHS
MINIMALLY NON-PFAFFIAN GRAPHS SERGUEI NORINE AND ROBIN THOMAS Abstract. We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-pfaffian graphs minimal with respect
More information1-factor and cycle covers of cubic graphs
1-factor and cycle covers of cubic graphs arxiv:1209.4510v [math.co] 29 Jan 2015 Eckhard Steffen Abstract Let G be a bridgeless cubic graph. Consider a list of k 1-factors of G. Let E i be the set of edges
More informationNowhere zero flow. Definition: A flow on a graph G = (V, E) is a pair (D, f) such that. 1. D is an orientation of G. 2. f is a function on E.
Nowhere zero flow Definition: A flow on a graph G = (V, E) is a pair (D, f) such that 1. D is an orientation of G. 2. f is a function on E. 3. u N + D (v) f(uv) = w ND f(vw) for every (v) v V. Example:
More informationExtension of Strongly Regular Graphs
Extension of Strongly Regular Graphs Ralucca Gera Department of Applied Mathematics Naval Postgraduate School, Monterey, CA 93943 email: rgera@nps.edu, phone (831) 656-2206, fax (831) 656-2355 and Jian
More informationTree-width. September 14, 2015
Tree-width Zdeněk Dvořák September 14, 2015 A tree decomposition of a graph G is a pair (T, β), where β : V (T ) 2 V (G) assigns a bag β(n) to each vertex of T, such that for every v V (G), there exists
More informationAn Ore-type Condition for Cyclability
Europ. J. Combinatorics (2001) 22, 953 960 doi:10.1006/eujc.2001.0517 Available online at http://www.idealibrary.com on An Ore-type Condition for Cyclability YAOJUN CHEN, YUNQING ZHANG AND KEMIN ZHANG
More informationComputing Sharp 2-factors in Claw-free Graphs
Computing Sharp 2-factors in Claw-free Graphs Hajo Broersma and Daniël Paulusma Department of Computer Science, Durham University, DH1 3LE Durham, United Kingdom, {hajo.broersma,daniel.paulusma}@durham.ac.uk
More informationEXCLUDING MINORS IN NONPLANAR GRAPHS OFGIRTHATLEASTFIVE. Robin Thomas 1 and. Jan McDonald Thomson 2
EXCLUDING MINORS IN NONPLANAR GRAPHS OFGIRTHATLEASTFIVE Robin Thomas 1 thomas@math.gatech.edu and Jan McDonald Thomson 2 thomson@math.gatech.edu School of Mathematics Georgia Institute of Technology Atlanta,
More informationGraphs & Algorithms: Advanced Topics Nowhere-Zero Flows
Graphs & Algorithms: Advanced Topics Nowhere-Zero Flows Uli Wagner ETH Zürich Flows Definition Let G = (V, E) be a multigraph (allow loops and parallel edges). An (integer-valued) flow on G (also called
More informationCycles with consecutive odd lengths
Cycles with consecutive odd lengths arxiv:1410.0430v1 [math.co] 2 Oct 2014 Jie Ma Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213. Abstract It is proved that there
More informationGraceful Tree Conjecture for Infinite Trees
Graceful Tree Conjecture for Infinite Trees Tsz Lung Chan Department of Mathematics The University of Hong Kong, Pokfulam, Hong Kong h0592107@graduate.hku.hk Wai Shun Cheung Department of Mathematics The
More informationDomination and Total Domination Contraction Numbers of Graphs
Domination and Total Domination Contraction Numbers of Graphs Jia Huang Jun-Ming Xu Department of Mathematics University of Science and Technology of China Hefei, Anhui, 230026, China Abstract In this
More informationK 4 -free graphs with no odd holes
K 4 -free graphs with no odd holes Maria Chudnovsky 1 Columbia University, New York NY 10027 Neil Robertson 2 Ohio State University, Columbus, Ohio 43210 Paul Seymour 3 Princeton University, Princeton
More informationNew sufficient condition for Hamiltonian graphs
Applied Mathematics Letters ( ) www.elsevier.com/locate/aml New sufficient condition for Hamiltonian graphs Kewen Zhao a,b,,hong-jian Lai c,yehong Shao d a Department of Mathematics, Qiongzhou University,
More informationBerge Trigraphs. Maria Chudnovsky 1 Princeton University, Princeton NJ March 15, 2004; revised December 2, Research Fellow.
Berge Trigraphs Maria Chudnovsky 1 Princeton University, Princeton NJ 08544 March 15, 2004; revised December 2, 2005 1 This research was partially conducted during the period the author served as a Clay
More information