Remarks on the Thickness of K n,n,n
|
|
- Rosanna Doyle
- 5 years ago
- Views:
Transcription
1 Remarks on the Thickness of K n,n,n Yan Yang Department of Mathematics Tianjin University, Tianjin 30007, P.R.China yanyang@tju.edu.cn Abstract The thickness θ(g) of a graph G is the minimum number of planar subgraphs into which G can be decomposed. In this paper, we provide a new upper bound for the thickness of the complete tripartite graphs K n,n,n (n 3) and obtain θ(k n,n,n ) = 3, when n 3 (mod 6). Keywords thickness; complete tripartite graph; planar subgraphs decomposition. Mathematics Subject Classification 05C10. 1 Introduction The thickness θ(g) of a graph G is the minimum number of planar subgraphs into which G can be decomposed. It was defined by Tutte [10] in 1963, derived from early work on biplanar graphs [,11]. It is a classical topological invariant of a graph and also has many applications to VLSI design, graph drawing, etc. Determining the thickness of a graph is NP-hard [6], so the results about thickness are few. The only types of graphs whose thicknesses have been determined are complete graphs [1,3], complete bipartite graphs [4] and hypercubes [5]. The reader is referred to [7,8] for more background on the thickness problems. In this paper, we study the thickness of complete tripartite graphs K n,n,n, (n 3). When n = 1,, it is easy to see that K 1,1,1 and K,, are planar graphs, so the thickness of both ones is one. Poranen proved θ(k n,n,n ) n in [9] which was the only result about the thickness of K n,n,n, as far as the author knows. We will give a new upper bound for θ(k n,n,n ) and provide the exact number for the thickness of K n,n,n, when n is congruent to 3 mod 6, the main results of this paper are the following theorems. Theorem 1. For n 3, θ(k n,n,n ) Theorem. θ(k n,n,n ) = 3 when n 3 (mod 6). The proofs of the theorems Supported by the National Natural Science Foundation of China under Grant No
2 In [4], Beineke, Harary and Moon determined the thickness of complete bipartite graph K m,n for almost all values of m and n. Lemm.[4] The thickness of K m,n is mn (m+n ) except possibly when m and n are odd, m n and there exists an integer k satisfying n = k(m ) m k. Lemm. For n 3, θ(k n,n,n ) 3. Proof. Since K n,n is a subgraph of K n,n,n, we have θ(k n,n,n ) θ(k n,n ). From Lemm, the thickness of K n,n (n 3) is 3, so the lemma follows. For the complete tripartite graph K n,n,n with the vertex partition (A, B, C), where A = {,..., a n 1 }, B = {,..., b n 1 } and C = {,..., c n 1 }, we define a type of graphs, they are planar spanning subgraphs of K n,n,n, denoted by G[a i b j+i c k+i ], in which 0 i, j, k n 1 and all subscripts are taken modulo n. The graph G[a i b j+i c k+i ] consists of n triangles a i b j+i c k+i for 0 i n 1 and six paths of length n 1, they are b j+1 c k+ b j+4 c k+5... i b j+3i+1 c k+3i+..., c k b j+ c k+3 b j+5... c k+3i i+1 b j+3i+..., b j c k+1 a b j+3 c k+4 a 5... b j+3i c k+3i+1 i+..., c k+1 b j+ c k+4 b j+5... i c k+3i+1 b j+3i+..., b j c k+ b j+3 c k+5... b j+3i i+1 c k+3i+..., c k b j+1 a c k+3 b j+4 a 5... c k+3i b j+3i+1 i+.... Equivalently, the graph G[a i b j+i c k+i ] is the graph with the same vertex set as K n,n,n and edge set {a i b j+i 1, a i b j+i, a i b j+i+1, a i c k+i 1, a i c k+i, a i c k+i+1 1 i n } {b j+i c k+i 1, b j+i c k+i, b j+i c k+i+1 1 i n } { b j, b j+1, a n 1 b j+n, a n 1 b j+n 1 } { c k, c k+1, a n 1 c k+n, a n 1 c k+n 1) } {b j c k, b j c k+1, b j+n 1 c k+n, b j+n 1 c k+n 1 }. Figure 1(a) illustrates the planar spanning subgraph G[a i b i c i ] of K 5,5,5.
3 3 c a b (a) The subgraph G 1 = G[a i b i c i ] of K 5,5,5 c c a a 3 b a (b) The subgraph G of K 5,5,5 (c) The subgraph G 3 of K 5,5,5 Figure 1 A planar subgraphs decomposition of K 5,5,5 Theorem 5. When n = 3p + (p is a positive integer), θ(k n,n,n ) p +. Proof. When n = 3p+ (p is a positive integer), we will construct two different planar subgraphs decompositions of K n,n,n according to p is odd or even, in which the number of planar subgraphs is p + in both cases. Case 1. p is odd. Let G 1,..., G p be p planar subgraphs of K n,n,n where G t = G[a i b i+3(t 1) c i+6(t 1) ], for 1 t p+1 ; and G t = G[a i b i+3(t 1) c i+6(t 1)+ ], for p+3 t p and p 3. From the structure of G[a i b j+i c k+i ], we get that no two edges in G 1,..., G p are repeated. Because subscripts in G t, 1 t p are taken modulo n, {3(t 1) (mod n) 1 t p} = {0, 3, 6,..., 3(p 1)}, {6(t 1) (mod n) 1 t p+1 p+3 } = {0, 6,..., 3(p 1)} and {6(t 1)+ (mod n) t p} = {3, 9,..., 3(p )}, the subscript sets of b and c in G t, 1 t p are the same, i.e.,
4 4 {i + 3(t 1) (mod n) 1 t p} = {i + 6(t 1) (mod n) 1 t p + 1 p + 3 } {i + 6(t 1) + (mod n) t p}. Furthermore, if there exists t {1,..., p} such that a i b j is an edge in G t, then a i c j is an edge in G k for some k {1,..., p}. If the edge a i b j is not in any G t, then neither is the edge a i c j in any G t, for 1 t p. From the construction of G t, the edges that belong to K n,n,n but not to any G t, 1 t p, are (t 1) 1, (t 1) 1, 1 t p (1) a n 1 (t 1), a n 1 (t 1), 1 t p () a i b i 3, a i b i, 0 i n 1 (3) a i c i 3, a i c i, 0 i n 1 (4) b i c i+3(t 1) 1, b i c i+3(t 1), 0 i n 1 and t = p + 3 (t 1) c 6(t 1) 1, (t 1) 1 c 6(t 1), 1 t p + 1 (t 1) c 6(t 1)+1, (t 1) 1 c 6(t 1)+, p + 3 (5) (6) t p and p 3 (7) Let G p+1 be the graph whose edge set consists of the edges in (3) and (5), and G p+ be the graph whose edge set consists of the edges in (1), (), (4), (6) and (7). In the following, we will describe plane drawings of G p+1 and G p+. (a) A planar embedding of G p+1. Place vertices,,..., b n 1 on a circle, place vertices a i+3 and c i+ in the middle of b i and b i+1, join each of a i+3 and c i+ to both b i and b i+1, we get a planar embedding of G p+1. For example, when p = 1, n = 5, Figure 1(b) shows the subgraph G of K 5,5,5. (b) A planar embedding of G p+. Firstly, we place vertices,,..., c n 1 on a circle, join vertex a i+3 to c i and c i+1, for 0 i n 1, so that we get a cycle of length n. Secondly, join vertex a n 1 to (t 1) for 1 t p, with lines inside of the cycle. Let l t be the line drawn inside the cycle joining a n 1 with c 6(t 1) 1 if 1 t p+1 or with c 6(t 1)+1 if p+3 t p (p 3). For 1 t p, insert the vertex (t 1) in the line l t. Thirdly, join vertex to (t 1) 1 for 1 t p, with lines outside of the cycle. Let l t be the line drawn outside the cycle joining with c 6(t 1) if 1 t p+1 or with c 6(t 1)+ if p+3 t p (p 3). For 1 t p, insert the vertex (t 1) 1 in the line l t. In this way, we can get a planar embedding of G p+. For example, when p = 1, n = 5, Figure 1(c) shows the subgraph G 3 of K 5,5,5. Summarizing, when p is an odd positive integer and n = 3p+, we get a decomposition of K n,n,n into p + planar subgraphs G 1,..., G p+.
5 Case. p is even. Let G 1,..., G p be p planar subgraphs of K n,n,n where G t = G[a i b i+3(t 1) c i+6(t 1)+3 ], for 1 t p ; and G t = G[a i b i+3(t 1) c i+6(t 1)+ ], for p+ t p. With a similar argument to the proof of Case 1, we can get that the subscript sets of b and c in G t, 1 t p are the same, i.e., {i + 3(t 1) (mod n) 1 t p} = {i + 6(t 1) + 3 (mod n) 1 t p p + } {i + 6(t 1) + (mod n) t p}. From the construction of G t, G p and G p+ have n edges in common, they are b i+3( p+ 1)c i+6( p+ 1)+1, 1 i n 1 and i n 4, we can delete them in one of these two graphs to avoid repetition. The edges that belong to K n,n,n but not to any G t, 1 t p, are (t 1) 1, (t 1) 1, 1 t p (8) a n 1 (t 1), a n 1 (t 1), 1 t p (9) a i b i 3, a i b i, 0 i n 1 (10) a i c i 3, a i c i, 0 i n 1 (11) b i c i 1, b i c i, b i c i+1, 0 i n 1 (1) 5 (t 1) c 6t 4, 1 t p (13) (t 1) c 6t 5, p + < t p (14) (t 1) 1 c 6t 3, 1 t < p (15) (t 1) 1 c 6t 4, p + t p (16) Let G p+1 be the graph whose edge set consists of the edges in (10), (11) and (1), and G p+ be the graph whose edge set consists of the edges in (8), (9), (13), (14), (15) and (16). We draw G p+1 in the following way. Firstly, place vertices,,,,..., b n 1, c n 1 on a circle C, join vertex c i to b i and b i+1, we get a cycle of length n. Secondly, place vertices, a,..., a n on a circle C in the unbounded region defined by the circle C such that C is contained in the closed disk defined by C, place vertices,,..., a n 1 on a circle C contained in the bounded region of C. Join a i to b i 3, b i, c i 3, and c i, join b i to c i+1. We can get a planar embedding of G p+1, so it is a planar graph. G p+ is also planar because it is a subgraph of a graph homeomorphic to a dipole (two vertices joined by some edges). For example, when p =, n = 8, Figure (c) and Figure (d) show the subgraphs G 3 and G 4 of K 8,8,8 respectively. Summarizing, when p is an even positive integer and n = 3p +, we obtain a decomposition of K n,n,n into p + planar subgraphs G 1,..., G p+.
6 6 Theorem follows from Cases 1 and. From the proof of Theorem 5, we draw planar subgraphs decompositions of K 5,5,5 and K 8,8,8 as illustrated in Figure 1 and Figure respectively. b 7 a 6 c 5 c 6 b a c 7 a 5 a 7 (a) The subgraph G 1 = G[a i b i c i+3] of K 8,8,8 c b a 6 c 5 b 7 c a a 5 c 6 a 7 c 7 (b) The subgraph G c c 5 b c 6 of K 8,8,8 in which G = G[a i b i+3 c i ]
7 7 a c7 b 7 c 6 b 7 b c c 7 b c 5 a 7 a 5 c a 6 a 7 (c) The subgraph G 3 of K 8,8,8 (d) The subgraph G 4 of K 8,8,8 Figure A planar subgraphs decomposition of K 8,8,8 Proof of Theorem 1. Because K n 1,n 1,n 1 is a subgraph of K n,n,n, θ(k n 1,n 1,n 1 ) θ(k n,n,n ), by Theorem 5, θ(k n,n,n ) p + also holds, when n = 3p or n = 3p + 1 (p is a positive integer), the theorem follows. Proof of Theorem. When n = 3p is odd, i.e., n 3 (mod 6), we decompose K n,n,n into p + 1 planar subgraphs G 1,..., G p+1, where G t = G[a i b i+3(t 1) c i+6(t 1) ], for 1 t p. With a similar argument to the proof of Theorem 5, we can get that the subscript sets of b and c in G t, 1 t p are the same, i.e., {i + 3(t 1) (mod n) 1 t p} = {i + 6(t 1) (mod n) 1 t p}. If the edge a i b j is in G t for some t {1,..., p}, then there exists k {1,..., p} such that a i c j is in G k. If the edge a i b j is not in any G t, then neither is the edge a i c j in any G t, for 1 t p. From the construction of G t = G[a i b i+3(t 1) c i+6(t 1) ], we list the edges that belong to K n,n,n but not to any G t, 1 t p, as follows. (t 1) 1, c 6(t 1) 1, 1 t p (17) a n 1 (t 1), a n 1 c 6(t 1), 1 t p (18) (t 1) c 6(t 1) 1, (t 1) 1 c 6(t 1), 1 t p (19) Let G p+1 be the graph whose edge set consists of the edges in (17), (18) and (19). It is easy to see that G p+1 is homeomorphic to a dipole and it is a planar graph. Summarizing, when p is an odd positive integer and n = 3p, we obtain a decomposition of K n,n,n into p+1 planar subgraphs G 1,..., G p+1, therefor θ(k n,n,n ) p+1. Combining this fact and Lemm, the theorem follows.
8 According to the proof of Theorem, we draw a planar subgraphs decomposition of K 3,3,3 as shown in Figure 3. 8 c b c a b a (a) The subgraph G 1 = G[a i b i c i ] of K 3,3,3 (b) The subgraph G of K 3,3,3 Figure 3 A planar subgraphs decomposition of K 3,3,3 For some other θ(k n,n,n ) with small n, combining Lemm and Poranen s result mentioned in Section 1, we have θ(k 4,4,4 ) =, θ(k 6,6,6 ) = 3. Since there exists a decomposition of K 7,7,7 with three planar subgraphs as shown in Figure 4, Lemm implies that θ(k 7,7,7 ) = 3. We also conjecture that the thickness of K n,n,n is 3 for all n 3. a 6 c 5 c b a c 6 (a) The subgraph G 1 = G[a i b i c i ] of K 7,7,7 a 5
9 9 a 6 c c 6 b c 5 a a 5 (b) The subgraph G b a a 5 c c 5 c 6 of K 7,7,7 in which G = G[a i b i+ c i+4 ] b a c 5 c 6 a 5 a 6 c (c) The subgraph G 3 of K 7,7,7 Figure 4 A planar subgraphs decomposition of K 7,7,7
10 10 Acknowledgements The author is grateful to the anonymous referees for many helpful comments and suggestions. References [1] V.B. Alekseev and V.S. Gonchakov, Thickness of arbitrary complete graphs, Mat. Sbornik, 101(143)() (1976), [] J. Battle, F. Harary, and Y. Kodama, Every planar graph with nine points has a nonplanar complement, Bull. Amer. Math. Soc., 68 (196), [3] L.W. Beineke and F. Harary, The thickness of the complete graph, Canad. J. Math., 17 (1965), [4] L.W. Beineke, F. Harary and J.W. Moon, On the thickness of the complete bipartite graph, Proc. Cambridge Philos. Soc., 60 (1964), 1 5. [5] M. Kleinert, Die Dicke des n-dimensionalen Würfel-Graphen, J. Combin. Theory, 3 (1967), [6] A. Mansfield, Determining the thickness of graphs is NP-hard, Math. Proc. Cambridge Philos. Soc., 93(9) (1983), 9 3. [7] E. Mäkinen and T. Poranen, An annotated bibliography on the thickness, outerthickness, and arboricity of a graph, Missouri J. Math. Sci., 4(1) (01), [8] P. Mutzel, T. Odenthal and M. Scharbrodt, The thickness a graph: a survey, Graphs and Combin., 14(1) (1998), [9] T. Poranen, A simulated annealing algorithm for determining the thickness of a graph, Inform. Sci., 17 (005), [10] W.T. Tutte, The thickness of a graph, Indag. Math., 5 (1963), [11] W.T. Tutte, The non-biplanar character of the complete 9-graph, Canad. Math. Bull., 6 (1963),
The thickness of K 1,n,n and K 2,n,n
Abstract ISSN 1855-3966 (printed edn.), ISSN 1855-397 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 15 (2018) 355 373 https://doi.org/10.2693/1855-397.1223.b26 (Also available at http://amc-journal.eu)
More informationThe 6-girth-thickness of the complete graph
The -girth-thickness of the complete graph arxiv:0.0v [math.co] Jul 0 Héctor Castañeda-López Pablo C. Palomino Andrea B. Ramos-Tort Christian Rubio-Montiel Claudia Silva-Ruíz July 0, 0 Abstract The g-girth-thickness
More informationPlanar Ramsey Numbers for Small Graphs
Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Andrzej Ruciński Faculty of Mathematics and Computer Science
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
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 informationarxiv: v1 [math.co] 27 Aug 2015
arxiv:1508.06934v1 [math.co] 27 Aug 2015 TRIANGLE-FREE UNIQUELY 3-EDGE COLORABLE CUBIC GRAPHS SARAH-MARIE BELCASTRO AND RUTH HAAS Abstract. This paper presents infinitely many new examples of triangle-free
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 informationarxiv: v2 [math.gr] 17 Dec 2017
The complement of proper power graphs of finite groups T. Anitha, R. Rajkumar arxiv:1601.03683v2 [math.gr] 17 Dec 2017 Department of Mathematics, The Gandhigram Rural Institute Deemed to be University,
More informationTough graphs and hamiltonian circuits
Discrete Mathematics 306 (2006) 910 917 www.elsevier.com/locate/disc Tough graphs and hamiltonian circuits V. Chvátal Centre de Recherches Mathématiques, Université de Montréal, Montréal, Canada Abstract
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 informationOn the Genus of the Graph of Tilting Modules
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 45 (004), No., 45-47. On the Genus of the Graph of Tilting Modules Dedicated to Idun Reiten on the occasion of her 60th birthday
More informationRegular Hamiltonian embeddings of the complete bipartite graph K n,n in an orientable surface
Regular Hamiltonian embeddings of the complete bipartite graph K n,n in an orientable surface M. J. Grannell, T. S. Griggs Department of Pure Mathematics The Open University Walton Hall Milton Keynes MK7
More informationThe maximum forcing number of a polyomino
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 69(3) (2017), Pages 306 314 The maximum forcing number of a polyomino Yuqing Lin Mujiangshan Wang School of Electrical Engineering and Computer Science The
More informationFORBIDDEN MINORS AND MINOR-CLOSED GRAPH PROPERTIES
FORBIDDEN MINORS AND MINOR-CLOSED GRAPH PROPERTIES DAN WEINER Abstract. Kuratowski s Theorem gives necessary and sufficient conditions for graph planarity that is, embeddability in R 2. This motivates
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 informationMATH 2200 Final Review
MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics
More informationMcGill University Faculty of Science. Solutions to Practice Final Examination Math 240 Discrete Structures 1. Time: 3 hours Marked out of 60
McGill University Faculty of Science Solutions to Practice Final Examination Math 40 Discrete Structures Time: hours Marked out of 60 Question. [6] Prove that the statement (p q) (q r) (p r) is a contradiction
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 informationDecomposing dense bipartite graphs into 4-cycles
Decomposing dense bipartite graphs into 4-cycles Nicholas J. Cavenagh Department of Mathematics The University of Waikato Private Bag 3105 Hamilton 3240, New Zealand nickc@waikato.ac.nz Submitted: Jun
More informationPlanar Graphs (1) Planar Graphs (3) Planar Graphs (2) Planar Graphs (4)
S-72.2420/T-79.5203 Planarity; Edges and Cycles 1 Planar Graphs (1) Topological graph theory, broadly conceived, is the study of graph layouts. Contemporary applications include circuit layouts on silicon
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
More informationAll Ramsey numbers for brooms in graphs
All Ramsey numbers for brooms in graphs Pei Yu Department of Mathematics Tongji University Shanghai, China yupeizjy@16.com Yusheng Li Department of Mathematics Tongji University Shanghai, China li yusheng@tongji.edu.cn
More informationUniquely 2-list colorable graphs
Discrete Applied Mathematics 119 (2002) 217 225 Uniquely 2-list colorable graphs Y.G. Ganjali a;b, M. Ghebleh a;b, H. Hajiabolhassan a;b;, M. Mirzazadeh a;b, B.S. Sadjad a;b a Institute for Studies in
More informationRegular factors of regular graphs from eigenvalues
Regular factors of regular graphs from eigenvalues Hongliang Lu Center for Combinatorics, LPMC Nankai University, Tianjin, China Abstract Let m and r be two integers. Let G be a connected r-regular graph
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 informationDecomposing oriented graphs into transitive tournaments
Decomposing oriented graphs into transitive tournaments Raphael Yuster Department of Mathematics University of Haifa Haifa 39105, Israel Abstract For an oriented graph G with n vertices, let f(g) denote
More informationChih-Hung Yen and Hung-Lin Fu 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 14, No. 1, pp. 273-286, February 2010 This paper is available online at http://www.tjm.nsysu.edu.tw/ LINEAR 2-ARBORICITY OF THE COMPLETE GRAPH Chih-Hung Yen and Hung-Lin
More informationCycle decompositions of the complete graph
Cycle decompositions of the complete graph A.J.W. Hilton Department of Mathematics University of Reading Whiteknights P.O. Box 220 Reading RG6 6AX U.K. Matthew Johnson Department of Mathematics London
More informationLeslie Hogben. Iowa State University and American Institute of Mathematics. University of Puerto Rico, Rio Piedras Campus February 25, 2015
s Iowa State University and American Institute of Mathematics University of Puerto Rico, Rio Piedras Campus February 5, 015 s Joint work with E. Gethner, B. Lidický, F. Pfender, A. Ruiz, M. Young. Definitions
More informationDecomposition of Complete Tripartite Graphs Into 5-Cycles
Decomposition of Complete Tripartite Graphs Into 5-Cycles E.S. MAHMOODIAN MARYAM MIRZAKHANI Department of Mathematical Sciences Sharif University of Technology P.O. Box 11365 9415 Tehran, I.R. Iran emahmood@irearn.bitnet
More informationNOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES
NOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES G. GRÄTZER AND E. KNAPP Abstract. Let D be a finite distributive lattice with
More informationON THE CORE OF A GRAPHf
ON THE CORE OF A GRAPHf By FRANK HARARY and MICHAEL D. PLUMMER [Received 8 October 1965] 1. Introduction Let G be a graph. A set of points M is said to cover all the lines of G if every line of G has at
More informationOn decomposing graphs of large minimum degree into locally irregular subgraphs
On decomposing graphs of large minimum degree into locally irregular subgraphs Jakub Przyby lo AGH University of Science and Technology al. A. Mickiewicza 0 0-059 Krakow, Poland jakubprz@agh.edu.pl Submitted:
More informationConstructive proof of deficiency theorem of (g, f)-factor
SCIENCE CHINA Mathematics. ARTICLES. doi: 10.1007/s11425-010-0079-6 Constructive proof of deficiency theorem of (g, f)-factor LU HongLiang 1, & YU QingLin 2 1 Center for Combinatorics, LPMC, Nankai University,
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationA shorter proof of Thomassen s theorem on Tutte paths in plane graphs
A shorter proof of Thomassen s theorem on Tutte paths in plane graphs Kenta Ozeki National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan and JST, ERATO, Kawarabayashi
More informationCYCLICALLY FIVE CONNECTED CUBIC GRAPHS. Neil Robertson 1 Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA
CYCLICALLY FIVE CONNECTED CUBIC GRAPHS Neil Robertson 1 Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA P. D. Seymour 2 Department of Mathematics Princeton University
More informationHamiltonian embeddings from triangulations
Hamiltonian embeddings from triangulations Mike J Grannell, Terry S Griggs Department of Mathematics The Open University Walton Hall Milton Keynes MK7 6AA UK Jozef Širáň Department of Mathematics Faculty
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 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 informationOn judicious bipartitions of graphs
On judicious bipartitions of graphs Jie Ma Xingxing Yu Abstract For a positive integer m, let fm be the maximum value t such that any graph with m edges has a bipartite subgraph of size at least t, and
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 informationarxiv:math/ v1 [math.co] 17 Apr 2002
arxiv:math/0204222v1 [math.co] 17 Apr 2002 On Arithmetic Progressions of Cycle Lengths in Graphs Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences
More informationCross-index of a graph
Cross-index of a graph Akio Kawauchi, Ayaka Shimizu, and Yoshiro Yaguchi Abstract. A family of topological invariants of a connected graph associated to every tree is introduced and called the cross-index.
More informationPacking chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph
Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph Boštjan Brešar a,b Douglas F. Rall d Sandi Klavžar a,b,c Kirsti Wash e a Faculty of Natural Sciences and Mathematics,
More information0-Sum and 1-Sum Flows in Regular Graphs
0-Sum and 1-Sum Flows in Regular Graphs S. Akbari Department of Mathematical Sciences Sharif University of Technology Tehran, Iran School of Mathematics, Institute for Research in Fundamental Sciences
More informationJacques Verstraëte
2 - Turán s Theorem Jacques Verstraëte jacques@ucsd.edu 1 Introduction The aim of this section is to state and prove Turán s Theorem [17] and to discuss some of its generalizations, including the Erdős-Stone
More informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
More informationOn (k, d)-multiplicatively indexable graphs
Chapter 3 On (k, d)-multiplicatively indexable graphs A (p, q)-graph G is said to be a (k,d)-multiplicatively indexable graph if there exist an injection f : V (G) N such that the induced function f :
More informationSome spectral inequalities for triangle-free regular graphs
Filomat 7:8 (13), 1561 1567 DOI 198/FIL138561K Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat Some spectral inequalities for triangle-free
More informationPSEUDO DIAGRAMS OF KNOTS, LINKS AND SPATIAL GRAPHS
PSEUDO DIAGRAMS OF KNOTS, LINKS AND SPATIAL GRAPHS RYO HANAKI Abstract. A pseudo diagram of a spatial graph is a spatial graph projection on the 2-sphere with over/under information at some of the double
More informationINTRCDUCTION Let n be a natural integer and let K be a set of naturals. One of the most central problems of combinatorial theory is to determine those
EDGE DECOMPOSITIONS OF THE COMPLETE GRAPH INTO COPIES OF A CONNECTED SUBGRAPH by P. Erdős and J. Schbnheim Department of Mathematics Statistics and Computing Science University of Calgary übo 2.A.. Necessary
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 informationDecomposition of random graphs into complete bipartite graphs
Decomposition of random graphs into complete bipartite graphs Fan Chung Xing Peng Abstract We consider the problem of partitioning the edge set of a graph G into the minimum number τg of edge-disjoint
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 informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More informationA cycle decomposition conjecture for Eulerian graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 58(1) (2014), Pages 48 59 A cycle decomposition conjecture for Eulerian graphs Gary Chartrand Department of Mathematics Western Michigan University Kalamazoo,
More informationSelf-complementary circulant graphs
Self-complementary circulant graphs Brian Alspach Joy Morris Department of Mathematics and Statistics Burnaby, British Columbia Canada V5A 1S6 V. Vilfred Department of Mathematics St. Jude s College Thoothoor
More informationBalanced bipartitions of graphs
2010.7 - Dedicated to Professor Feng Tian on the occasion of his 70th birthday Balanced bipartitions of graphs Baogang Xu School of Mathematical Science, Nanjing Normal University baogxu@njnu.edu.cn or
More information2 β 0 -excellent graphs
β 0 -excellent graphs A. P. Pushpalatha, G. Jothilakshmi Thiagarajar College of Engineering Madurai - 65 015 India Email: gjlmat@tce.edu, appmat@tce.edu S. Suganthi, V. Swaminathan Ramanujan Research Centre
More informationA note on balanced bipartitions
A note on balanced bipartitions Baogang Xu a,, Juan Yan a,b a School of Mathematics and Computer Science Nanjing Normal University, 1 Ninghai Road, Nanjing, 10097, China b College of Mathematics and System
More informationarxiv: v1 [math.co] 29 Jul 2010
RADIO NUMBERS FOR GENERALIZED PRISM GRAPHS PAUL MARTINEZ, JUAN ORTIZ, MAGGY TOMOVA, AND CINDY WYELS arxiv:1007.5346v1 [math.co] 29 Jul 2010 Abstract. A radio labeling is an assignment c : V (G) N such
More informationEnumeration of subtrees of trees
Enumeration of subtrees of trees Weigen Yan a,b 1 and Yeong-Nan Yeh b a School of Sciences, Jimei University, Xiamen 36101, China b Institute of Mathematics, Academia Sinica, Taipei 1159. Taiwan. Theoretical
More informationDecompositions of Balanced Complete Bipartite Graphs into Suns and Stars
International Journal of Contemporary Mathematical Sciences Vol. 13, 2018, no. 3, 141-148 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2018.8515 Decompositions of Balanced Complete Bipartite
More informationCrossing-Number Critical Graphs have Bounded Path-width
Crossing-Number Critical Graphs have Bounded Path-width Petr Hliněný School of Mathematical and Computing Sciences, Victoria University of Wellington, New Zealand hlineny@member.ams.org Current mailing
More informationThe super line graph L 2
Discrete Mathematics 206 (1999) 51 61 www.elsevier.com/locate/disc The super line graph L 2 Jay S. Bagga a;, Lowell W. Beineke b, Badri N. Varma c a Department of Computer Science, College of Science and
More informationForcing unbalanced complete bipartite minors
Forcing unbalanced complete bipartite minors Daniela Kühn Deryk Osthus Abstract Myers conjectured that for every integer s there exists a positive constant C such that for all integers t every graph of
More informationOn cyclic decompositions of K n+1,n+1 I into a 2-regular graph with at most 2 components
On cyclic decompositions of K n+1,n+1 I into a 2-regular graph with at most 2 components R. C. Bunge 1, S. I. El-Zanati 1, D. Gibson 2, U. Jongthawonwuth 3, J. Nagel 4, B. Stanley 5, A. Zale 1 1 Department
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 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 informationUNIQUENESS OF HIGHLY REPRESENTATIVE SURFACE EMBEDDINGS
UNIQUENESS OF HIGHLY REPRESENTATIVE SURFACE EMBEDDINGS P. D. Seymour Bellcore 445 South St. Morristown, New Jersey 07960, USA and Robin Thomas 1 School of Mathematics Georgia Institute of Technology Atlanta,
More informationDecomposing plane cubic graphs
Decomposing plane cubic graphs Kenta Ozeki and Dong Ye Abstract It was conjectured by Hoffmann-Ostenhof that the edge set of every cubic graph can be decomposed into a spanning tree, a matching and a family
More informationSmall Cycle Cover of 2-Connected Cubic Graphs
. Small Cycle Cover of 2-Connected Cubic Graphs Hong-Jian Lai and Xiangwen Li 1 Department of Mathematics West Virginia University, Morgantown WV 26505 Abstract Every 2-connected simple cubic graph of
More informationSome constructions of integral graphs
Some constructions of integral graphs A. Mohammadian B. Tayfeh-Rezaie School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran ali m@ipm.ir tayfeh-r@ipm.ir
More informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationEnumeration of unlabeled graphs such that both the graph and its complement are 2-connected
SUT Journal of Mathematics Vol. 52, No. 1 (2016), 41 47 Enumeration of unlabeled graphs such that both the graph and its complement are 2-connected Kumi Kobata, Shinsei Tazawa and Tomoki Yamashita (Received
More informationSergey Norin Department of Mathematics and Statistics McGill University Montreal, Quebec H3A 2K6, Canada. and
NON-PLANAR EXTENSIONS OF SUBDIVISIONS OF PLANAR GRAPHS Sergey Norin Department of Mathematics and Statistics McGill University Montreal, Quebec H3A 2K6, Canada and Robin Thomas 1 School of Mathematics
More informationPacking and decomposition of graphs with trees
Packing and decomposition of graphs with trees Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel. e-mail: raphy@math.tau.ac.il Abstract Let H be a tree on h 2 vertices.
More informationVertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 17:3, 2015, 1 12 Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights Hongliang Lu School of Mathematics and Statistics,
More informationMultipartite tournaments with small number of cycles
Multipartite tournaments with small number of cycles Gregory Gutin and Arash Rafiey Department of Computer Science Royal Holloway, University of London Egham, Surrey, TW20 0EX, UK Gutin(Arash)@cs.rhul.ac.uk
More informationAnother Proof of Nathanson s Theorems
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 14 (2011), Article 11.8.4 Another Proof of Nathanson s Theorems Quan-Hui Yang School of Mathematical Sciences Nanjing Normal University Nanjing 210046
More informationSpanning trees on the Sierpinski gasket
Spanning trees on the Sierpinski gasket Shu-Chiuan Chang (1997-2002) Department of Physics National Cheng Kung University Tainan 70101, Taiwan and Physics Division National Center for Theoretical Science
More informationColloq. Math. 145(2016), no. 1, ON SOME UNIVERSAL SUMS OF GENERALIZED POLYGONAL NUMBERS. 1. Introduction. x(x 1) (1.1) p m (x) = (m 2) + x.
Colloq. Math. 145(016), no. 1, 149-155. ON SOME UNIVERSAL SUMS OF GENERALIZED POLYGONAL NUMBERS FAN GE AND ZHI-WEI SUN Abstract. For m = 3, 4,... those p m (x) = (m )x(x 1)/ + x with x Z are called generalized
More informationNOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES
NOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES G. GRÄTZER AND E. KNAPP Abstract. Let D be a finite distributive lattice with
More informationSupereulerian 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 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 informationC 7 -DECOMPOSITIONS OF THE TENSOR PRODUCT OF COMPLETE GRAPHS
Discussiones Mathematicae Graph Theory 37 (2017) 523 535 doi:10.7151/dmgt.1936 C 7 -DECOMPOSITIONS OF THE TENSOR PRODUCT OF COMPLETE GRAPHS R.S. Manikandan Department of Mathematics Bharathidasan University
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 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 informationTutte Polynomials with Applications
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 6 (26), pp. 4781 4797 Research India Publications http://www.ripublication.com/gjpam.htm Tutte Polynomials with Applications
More informationAcyclic Digraphs arising from Complete Intersections
Acyclic Digraphs arising from Complete Intersections Walter D. Morris, Jr. George Mason University wmorris@gmu.edu July 8, 2016 Abstract We call a directed acyclic graph a CI-digraph if a certain affine
More informationGallai-Ramsey numbers for a class of graphs with five vertices arxiv: v1 [math.co] 15 Nov 2018
Gallai-Ramsey numbers for a class of graphs with five vertices arxiv:1811.06134v1 [math.co] 15 Nov 018 Xihe Li a,b and Ligong Wang a,b, a Department of Applied Mathematics, School of Science, Northwestern
More informationTHE MINOR CROSSING NUMBER
University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 19, 1111 Ljubljana, Slovenia Preprint series, Vol. 43 (2005), 973 THE MINOR CROSSING NUMBER Drago
More informationRELATIVE N-TH NON-COMMUTING GRAPHS OF FINITE GROUPS. Communicated by Ali Reza Ashrafi. 1. Introduction
Bulletin of the Iranian Mathematical Society Vol. 39 No. 4 (2013), pp 663-674. RELATIVE N-TH NON-COMMUTING GRAPHS OF FINITE GROUPS A. ERFANIAN AND B. TOLUE Communicated by Ali Reza Ashrafi Abstract. Suppose
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 informationThe cycle polynomial of a permutation group
The cycle polynomial of a permutation group Peter J. Cameron School of Mathematics and Statistics University of St Andrews North Haugh St Andrews, Fife, U.K. pjc0@st-andrews.ac.uk Jason Semeraro Department
More informationThe smallest k-regular h-edge-connected graphs without 1-factors
The smallest k-regular h-edge-connected graphs without 1-factors John Ganci, Douglas B. West March 30, 2003 Dedicated to the memory of Bill Tutte Abstract The minimum order of a k-regular h-edge-connected
More informationOn Some Three-Color Ramsey Numbers for Paths
On Some Three-Color Ramsey Numbers for Paths Janusz Dybizbański, Tomasz Dzido Institute of Informatics, University of Gdańsk Wita Stwosza 57, 80-952 Gdańsk, Poland {jdybiz,tdz}@inf.ug.edu.pl and Stanis
More informationMalaya J. Mat. 2(3)(2014)
Malaya J Mat (3)(04) 80-87 On k-step Hamiltonian Bipartite and Tripartite Graphs Gee-Choon Lau a,, Sin-Min Lee b, Karl Schaffer c and Siu-Ming Tong d a Faculty of Comp & Mathematical Sciences, Universiti
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 information