# Edge looseness of plane graphs

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Also available at ISSN (printed edn.), ISSN (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 9 (015) Edge looseness of plane graphs Július Czap Department of Applied Mathematics and Business Informatics, Faculty of Economics Technical University of Košice, Němcovej, Košice, Slovakia Received 7 February 014, accepted 15 April 015, published online 8 July 015 Abstract A face of an edge colored plane graph is called e-loose if the number of colors used on its edges is at least three. The e-looseness of a plane graph G is the minimum positive integer k such that any edge coloring of G with k colors involves an e-loose face. In this paper we determine tight lower and upper bounds for the e-looseness of connected plane graphs. These bounds are expressed by linear polynomials of the number of faces. Keywords: Plane graph, edge coloring. Math. Subj. Class.: 05C10, 05C15 1 Introduction We use the standard terminology according to Bondy and Murty [1]. All considered graphs are undirected, finite, loopless, multiple edges are allowed. Let G = (V, E, F ) denote a connected plane graph with the vertex set V, the edge set E and the face set F. We say that two edges of G are face-independent if they are not incident with the same face. Two edges of G are face-adjacent if they are consecutive edges of a facial trail of some face. The medial graph M(G) of G is the simple graph obtained as follows. For each edge e of G insert a vertex m(e) in M(G). Join two vertices of M(G) if the corresponding edges are face-adjacent in G. The embedding of G induces the embedding of M(G). Edge colorings of graphs embedded on surfaces with face-constrains have recently drawn a substantial amount of attention, see [5, 6, 7, 1] and references therein. There are two questions derived from hypergraph colorings that one may ask in this setting: Question 1.1. What is the minimum number of colors needed to color the edges of a connected plane graph in such a way that each of its faces is incident with edges of at least two different colors? address: (Július Czap) cb This work is licensed under

2 90 Ars Math. Contemp. 9 (015) Question 1.. What is the maximum number of colors that can be used in an edge coloring of a connected plane graph in such a way that each of its faces is incident with edges of at most two different colors? The following result gives the answer to Question 1.1. Theorem 1.. Every connected plane graph (on at least two edges) has an edge coloring with at most colors such that each of its faces is incident with edges of at least two different colors. Moreover, if G is simple, then colors are sufficient. Proof. First we show that every connected plane graph without faces of size two has an edge coloring with colors such that these two colors appear on every face. Let G be such a plane graph and let M(G) be its medial graph. Add edges to M(G) to obtain a plane triangulation T. By the Four Color Theorem, T has a proper vertex coloring which uses or 4 colors. Combine the first color class with the second, and combine the third with the fourth. This yields a -coloring of the graph T. It is easy to check that each face of T is incident with vertices of two different colors. This vertex coloring induces a required edge coloring of G. Now assume that the claim does not hold for a connected plane graph with faces of size two. Let G be a counterexample on minimum number of edges. Let e be an edge which is incident with faces f and g, where f has size two. Let G e be the graph obtained from G by removing the edge e. The graph G e is not a counterexample because it has fewer edges than G. Consequently, it has a required coloring. Let h be the face in G e corresponding to the faces f and g in G. Extend the coloring of G e to a coloring of G in the following way. If two colors appear on h, then color e with the third color. Otherwise (three colors appear on h) we color e with a color which does not appear on the second edge of f. This means that the minimum counterexample does not exist. There are graphs which require three colors for such a coloring, for example the connected graph on two vertices and three edges. In this paper, we focus on Question 1.. A face of an edge colored plane graph is called monochromatic or bichromatic if the number of colors used on its edges is one or two, respectively. A face which is neither monochromatic nor bichromatic is called edge loose (or shortly e-loose). The edge looseness (or shortly e-looseness) of a plane graph G is the minimum positive integer k such that any surjective k-edge-coloring involves an e-loose face. This parameter of G will be denoted by els(g). The e-looseness is well defined for all plane graphs having at least one face incident with at least three different edges. (Note that every connected plane graph on at least four vertices has such a face.) Throughout the paper, we will consider only such graphs. Upper bounds.1 1-connected plane graphs Theorem.1. Let G = (V, E, F ) be a connected plane graph. Then els(g) F +. Moreover, this bound is sharp. Proof. Let ϕ be an edge coloring of G such that each of its faces is either monochromatic or bichromatic. First we show that ϕ uses at most F + 1 colors. Clearly, we can assume that ϕ uses at least two colors. This means that at least one face is bichromatic, say f 1. Let

3 J. Czap: Edge looseness of plane graphs 91 f be a face of G adjacent to f 1. There is at most one color which appears on f and does not appear on f 1, since the faces f 1 and f share an edge and at most two colors occur on f. The graph G is connected, therefore we can number the faces f 1, f,..., f F of G such that for every i the face f i is adjacent to a face f j for some j < i. Using the argument described above, there is at most one color which appears on f j and does not appear on f 1,..., f j 1. Consequently, ϕ uses at most + ( F 1) colors. This means that every edge coloring with at least F + colors involves an e-loose face. Now we prove that this upper bound is tight. Let H be a connected plane graph on at least three vertices. We insert a new vertex into each face of H and join each new vertex by an edge inside the corresponding face to exactly one of its vertices. In this way we obtain a 1-connected plane graph H. Clearly, we added F (H) edges to H and these new edges are face-independent in H. If we color these face-independent edges with distinct colors and all other edges with the same color, then we obtain an edge coloring of H such that every face is bichromatic. Hence, els( H) F (H) + = F ( H) +.. -connected plane graphs When G is -connected, the bound from Theorem.1 can be improved by one. Let us recall that the (geometric) dual G = (V, E, F ) of a plane graph G = (V, E, F ) can be defined as follows: Corresponding to each face f of G there is a vertex f of G, and corresponding to each edge e of G there is an edge e of G ; two vertices f and g are joined by the edge e in G if and only if their corresponding faces f and g are separated by the edge e in G (an edge separates the faces incident with it). Theorem.. Let G = (V, E, F ) be a -connected plane graph. Then els(g) F + 1. Moreover, this bound is sharp. Proof. Let ϕ be an edge coloring of G such that every face is either monochromatic or bichromatic. This coloring induces a coloring of the dual G in a natural way. Observe that at most colors appear at any vertex of G. Let us choose one edge from each color class, and let the chosen edges induce the subgraph H of G. Each component of H is either a path or a cycle, since the graph G does not contain any loop. Therefore, E(H) = v V (H) deg H(v) V (H) V (G ) = F (G). Since the number of colors used by ϕ equals E(H), we deduce that ϕ uses at most F (G) colors. To see that the bound is tight consider the plane embedding of the complete bipartite graph K,n, see Figure 1. This plane graph has n faces and an n-edge-coloring such that every face is bichromatic. 1 1 n n 1 n n 1 n n Figure 1: A plane drawing of K,n.

4 9 Ars Math. Contemp. 9 (015) connected plane graphs Lemma.. Let G = (V, E, F ) be a -connected plane triangulation. Let t denote the maximum number of disjoint cycles in its dual. Then els(g) = 1 F t. Proof. Any M -edge coloring (being an edge coloring of a graph such that at most colors appear at any vertex, see [, ]) of the dual graph G corresponds to an edge coloring of G with property that every face of G is incident with edges of at most two different colors and vice versa. The graph G is cubic, since G is a plane triangulation. In [], it was proved that the maximum number of colors that can be used in an M -edge coloring of a cubic V (H) plane graph H is equal to H. Consequently, els(g) = V (G ) + t + 1 = + t, where t is the maximum number of disjoint cycles in F (G) + t + 1. Theorem.4. Let G = (V, E, F ) be a -connected plane triangulation. Let g denote the girth of its dual. Then els(g) 5 6 F + 1 if g, els(g) 4 F + 1 if g 4, els(g) 7 10 F + 1 if g 5. Moreover, these bounds are sharp. Proof. It follows from Lemma., since the number of disjoint cycles in the dual G is not greater than V (G ) F (G) g = g. By Lemma. we can easily prove that the bounds are attained on the duals of graphs shown in Figure. Figure : The duals of these graphs show that the bounds are tight. Conjecture.5. Let G = (V, E, F ) be a -connected plane graph. F Then els(g) Lower bounds A matching of G is a set of pairwise disjoint edges, and a maximum matching is one of maximum cardinality. Let c(h) denote the number of components of a graph H. Lemma.1. Let G be a connected plane graph and let G be its dual. Let M be a matching in G. Then els(g) M + c(g M ) + 1. Moreover, this bound is sharp.

5 J. Czap: Edge looseness of plane graphs 9 Proof. We color the edges of the matching M with distinct colors and use an additional new color for the edges of each component of G M. Thus, we obtain an edge coloring of the dual graph G such that at most colors appear at any vertex of G. This coloring induces a coloring of G in which every face is either monochromatic or bichromatic. To see that the bound is sharp, let G be a plane graph whose dual is a r-sided prism. The r-sided prism H r, r, consists of the vertex set V = {u 1, u,..., u r, v 1, v,..., v r } and the edge set E = {u i u i+1, v i v i+1, u i v i i = 1,..., r}, where r + 1 := 1. The set of faces consists of two r-gonal faces f 1 = [u 1,..., u r ] and f = [v 1,..., v r ] and r quadrangles [u i u i+1 v i+1 v i ] for i = 1,,..., r, see Figure for illustration. Figure : A r-sided prism. Let M = {u i u i+1, v i v i+1 i = 1,, 5,..., r 1} be a matching of H r. Observe that M = r and c(h r M) = r. Therefore els(g) r + 1. On the other hand, the graph H r is a simple -connected cubic plane graph, hence its dual (the graph G) is a simple triangulation. By Theorem.4 we have els(g) 4 4r + 1. Corollary.. Let G be a connected plane graph and let G be its dual. Let M be a maximum matching in G. Then els(g) M +. Proof. It immediately follows from Lemma.1, since c(g M ) 1. Since there are -connected (and 1-connected) graphs G with arbitrarily many faces which have els(g) 4 (Take a plane drawing of the cycle C = v 1 v... v n. Add n vertices u 1, u,..., u n to the inner part of C and join u i with v i and v i as it is depicted in Figure 4. It is easy to see that the e-looseness of the obtained graph is four.), there is no nontrivial lower bound on els(g) expressed by a linear polynomial of F if G is not -connected. Hence, in the remaining part of the paper we will investigate e-looseness of -connected plane graphs G. Since the dual of G is a simple plane graph, we may apply structural properties of planar graphs on the dual graph; in particular, we will use the following one. v 5 v v 4 u v 6 v 7 v u 1 u v 8 v 1 v 9 Figure 4: A graph G with many faces and els(g) = 4.

6 94 Ars Math. Contemp. 9 (015) Theorem.. [11] Let G be an n-vertex -connected planar graph with n 78. Let δ denote the minimum degree of G and let M be a maximum matching in G. Then, M n+4 if δ, M n+8 7 if δ 4, M 9n+0 19 if δ 5. Note that, if a planar graph G is 4-connected, then it has a matching of size V (G). This immediately follows from Tutte s result [14]: every 4-connected planar graph contains a Hamiltonian cycle. Lemma.4. Let G = (V, E, F ) be a -connected plane graph. Then it has at least V + faces. Moreover, this bound is tight. Proof. The minimum degree of G is at least, since it is -connected. Using the handshaking lemma we have E = v V deg(v) V. Consequently, E V. Using this fact and the Euler s polyhedral formula V E + F = we obtain F + V. This bound is attained for every -connected cubic plane graph. Using Corollary., Theorem. and Lemma.4 we can prove the following. Theorem.5. Let G = (V, E, F ) be a -connected plane graph on at least 15 vertices. Let g be the girth of G. Then, els(g) F +4 + if g, F +8 els(g) 7 + if g 4, 9 F +0 els(g) 19 + if g 5. Moreover, these bounds are sharp. Proof. The -connectedness of G implies that its dual G is also -connected, hence we can use Theorem. for G. By Lemma.4, V (G V (G) ) = F (G) It is easy to check that n+4 n+8 7 9n+0 19 for n. As g(g) δ(g ), the result follows from Corollary. and Theorem.. The sharpness of these bounds follows from Theorem.6. Theorem.6. For any integer n 4 there exists a -connected cubic plane graph G = (V, E, F ) with girth g such that g =, F = n 4 and els(g) = n +, g = 4, F = 7n 1 and els(g) = n, g = 5, F = 19n 6 and els(g) = 9n 14. Proof. Let T be a simple plane triangulation on n 4 vertices. Let G i be the graph obtained from T by inserting the configuration H i, shown in Figure 5, into each of its faces, for i =, 4, 5. Any plane triangulation on n vertices has n 4 faces, therefore F (G ) = V (G ) = n + n 4 = n 4,

7 J. Czap: Edge looseness of plane graphs 95 H H 4 H 5 Figure 5: A construction of triangulations with edge-connectivity, 4 and 5. F (G 4) = V (G 4 ) = n + (n 4) = 7n 1 and F (G 5) = V (G 5 ) = n + 9(n 4) = 19n 6. In [] it was proved that K (G ) = n + 1, K (G 4 ) = n and K (G 5 ) = 9n 15, where K (G i ) denotes the maximum number of colors used in an M -edge coloring of G i, i =, 4, 5. Consequently, for the duals of these graphs it holds els(g ) = n +, els(g 4) = n and els(g 5) = 9n 14. Observe, that each minimum edge-cut of size g in G i corresponds to a cycle in G i and vice versa, therefore, the edge connectivity of the graph G i is equal to the girth of the dual graph G i. The edge connectivity of G i is equal to i, for i =, 4, 5, since the tetrahedron, octahedron and icosahedron have edge connectivities, 4 and 5, respectively. Finally, note that the vertex version of Question 1. was investigated in [4], where it was proved that the vertex looseness of a connected plane graph G equals the maximum number of vertex disjoint cycles in the dual graph G increased by. Vertex looseness of triangulations on closed surfaces was studied in [8, 9, 10, 1]. References [1] J.A. Bondy and U.S.R. Murty, Graph theory, Springer, New York, 008. [] K. Budajová and J. Czap, M -edge coloring and maximum matching of graphs, Int. J. Pure Appl. Math. 88 (01), [] J. Czap, M i-edge colorings of graphs, Appl. Math. Sciences 5 (011), [4] J. Czap, S. Jendrol, F. Kardoš and J. Miškuf, Looseness of plane graphs, Graphs Combin. 7 (011), [5] S. Jendrol, J. Miškuf, R. Soták and E. Škrabul áková, Rainbow faces in edge-colored plane graphs, J. Graph Theory 6 (009), [6] B. Lužar, M. Mockovčiaková, R. Soták, R. Škrekovski and P. Šugerek, l-facial edge colorings of graphs, Discrete Appl. Math. 181 (015), [7] B. Lužar and R. Škrekovski, Improved bound on facial parity edge coloring, Discrete Math. 1 (01), 18. [8] K. Matsuoka, Looseness width of 5-connected triangulations on the torus, Electron. Notes Discrete Math. 1 (008), [9] S. Negami, Looseness ranges of triangulations on closed surfaces, Discrete Math. 0 (005), [10] S. Negami and T. Midorikawa Loosely-tightness of triangulations of closed surfaces, Sci. Rep. Yokohama Nat. Univ., Sect. I, Math. Phys. Chem. 4 (1996), 5 41.

8 96 Ars Math. Contemp. 9 (015) [11] T. Nishizeki and I. Baybars, Lower bounds on the cardinality of the maximum matchings of planar graphs, Discrete Math. 8 (1979), [1] J. Przybylo, On the facial Thue choice index via entropy compression, J. Graph Theory 77 (014), [1] T. Tanuma, One-loosely tight triangulations of closed surfaces, Yokohama Math. J. 47 (1999), [14] W.T. Tutte, A theorem on planar graphs, Trans. Am. Math. Soc. 8 (1956),

### Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

### Total colorings of planar graphs with small maximum degree

Total colorings of planar graphs with small maximum degree Bing Wang 1,, Jian-Liang Wu, Si-Feng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### M-Degrees of Quadrangle-Free Planar Graphs

M-Degrees of Quadrangle-Free Planar Graphs Oleg V. Borodin, 1 Alexandr V. Kostochka, 1,2 Naeem N. Sheikh, 2 and Gexin Yu 3 1 SOBOLEV INSTITUTE OF MATHEMATICS NOVOSIBIRSK 630090, RUSSIA E-mail: brdnoleg@math.nsc.ru

### The chromatic spectrum of mixed hypergraphs

The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex

### A 2-factor in which each cycle has long length in claw-free graphs

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

### Best Monotone Degree Bounds for Various Graph Parameters

Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer

### Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

### On planar regular graphs degree three without Hamiltonian cycles 1

On planar regular graphs degree three without Hamiltonian cycles 1 E. Grinbergs Computing Centre of Latvian State University Abstract. Necessary condition to have Hamiltonian cycle in planar graph is given.

### Removing Even Crossings

EuroComb 2005 DMTCS proc. AE, 2005, 105 110 Removing Even Crossings Michael J. Pelsmajer 1, Marcus Schaefer 2 and Daniel Štefankovič 2 1 Department of Applied Mathematics, Illinois Institute of Technology,

### Introduction to Graph Theory

Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate

### Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

### Topological Treatment of Platonic, Archimedean, and Related Polyhedra

Forum Geometricorum Volume 15 (015) 43 51. FORUM GEOM ISSN 1534-1178 Topological Treatment of Platonic, Archimedean, and Related Polyhedra Tom M. Apostol and Mamikon A. Mnatsakanian Abstract. Platonic

### Product irregularity strength of certain graphs

Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer

### The Independence Number in Graphs of Maximum Degree Three

The Independence Number in Graphs of Maximum Degree Three Jochen Harant 1 Michael A. Henning 2 Dieter Rautenbach 1 and Ingo Schiermeyer 3 1 Institut für Mathematik, TU Ilmenau, Postfach 100565, D-98684

### SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices

### An inequality for the group chromatic number of a graph

An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics

### 2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

### Odd induced subgraphs in graphs of maximum degree three

Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A long-standing

### The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

### Non-Separable Detachments of Graphs

Egerváry Research Group on Combinatorial Optimization Technical reports TR-2001-12. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.

### Midterm Practice Problems

6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator

### Balloons, Cut-Edges, Matchings, and Total Domination in Regular Graphs of Odd Degree

Balloons, Cut-Edges, Matchings, and Total Domination in Regular Graphs of Odd Degree Suil O, Douglas B. West November 9, 2008; revised June 2, 2009 Abstract A balloon in a graph G is a maximal 2-edge-connected

### Zachary Monaco Georgia College Olympic Coloring: Go For The Gold

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various

### Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

### The minimum number of distinct areas of triangles determined by a set of n points in the plane

The minimum number of distinct areas of triangles determined by a set of n points in the plane Rom Pinchasi Israel Institute of Technology, Technion 1 August 6, 007 Abstract We prove a conjecture of Erdős,

### An inequality for the group chromatic number of a graph

Discrete Mathematics 307 (2007) 3076 3080 www.elsevier.com/locate/disc Note An inequality for the group chromatic number of a graph Hong-Jian Lai a, Xiangwen Li b,,1, Gexin Yu c a Department of Mathematics,

### arxiv: v2 [math.co] 30 Nov 2015

PLANAR GRAPH IS ON FIRE PRZEMYSŁAW GORDINOWICZ arxiv:1311.1158v [math.co] 30 Nov 015 Abstract. Let G be any connected graph on n vertices, n. Let k be any positive integer. Suppose that a fire breaks out

### 8. Matchings and Factors

8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,

### Cycles and clique-minors in expanders

Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor

### On an anti-ramsey type result

On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element

### On one-factorizations of replacement products

Filomat 27:1 (2013), 57 63 DOI 10.2298/FIL1301057A Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On one-factorizations of replacement

### On three zero-sum Ramsey-type problems

On three zero-sum Ramsey-type problems Noga Alon Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel and Yair Caro Department of Mathematics

### On Some Vertex Degree Based Graph Invariants

MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 65 (20) 723-730 ISSN 0340-6253 On Some Vertex Degree Based Graph Invariants Batmend Horoldagva a and Ivan

### Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs

MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set

### GRAPHS AND ZERO-DIVISORS. In an algebra class, one uses the zero-factor property to solve polynomial equations.

GRAPHS AND ZERO-DIVISORS M. AXTELL AND J. STICKLES In an algebra class, one uses the zero-factor property to solve polynomial equations. For example, consider the equation x 2 = x. Rewriting it as x (x

### The degree, size and chromatic index of a uniform hypergraph

The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### SHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE

SHOT YLE OVES OF PHS WITH MINIMUM DEEE THEE TOMÁŠ KISE, DNIEL KÁL, END LIDIKÝ, PVEL NEJEDLÝ OET ŠÁML, ND bstract. The Shortest ycle over onjecture of lon and Tarsi asserts that the edges of every bridgeless

### When is a graph planar?

When is a graph planar? Theorem(Euler, 1758) If a plane multigraph G with k components has n vertices, e edges, and f faces, then n e + f = 1 + k. Corollary If G is a simple, planar graph with n(g) 3,

### arxiv:1409.4299v1 [cs.cg] 15 Sep 2014

Planar Embeddings with Small and Uniform Faces Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl 3, and Ignaz Rutter 3,4 arxiv:409.499v [cs.cg] 5 Sep 04 Department of Engineering, Roma Tre University, Italy

### On end degrees and infinite cycles in locally finite graphs

On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel

### Extreme Intersection Points in Arrangements of Lines

Extreme Intersection Points in Arrangements of Lines Rom Pinchasi August 1, 01 Abstract We provide a strengthening of the classical theorem of Erdős [3] saing that n lines in the plane, no two of which

### A Turán Type Problem Concerning the Powers of the Degrees of a Graph

A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:

### On the k-path cover problem for cacti

On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we

### GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

### A Study of Sufficient Conditions for Hamiltonian Cycles

DeLeon 1 A Study of Sufficient Conditions for Hamiltonian Cycles Melissa DeLeon Department of Mathematics and Computer Science Seton Hall University South Orange, New Jersey 07079, U.S.A. ABSTRACT A graph

### Minimum degree condition forcing complete graph immersion

Minimum degree condition forcing complete graph immersion Matt DeVos Department of Mathematics Simon Fraser University Burnaby, B.C. V5A 1S6 Jacob Fox Department of Mathematics MIT Cambridge, MA 02139

### COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

### Finding and counting given length cycles

Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected

### Tenacity and rupture degree of permutation graphs of complete bipartite graphs

Tenacity and rupture degree of permutation graphs of complete bipartite graphs Fengwei Li, Qingfang Ye and Xueliang Li Department of mathematics, Shaoxing University, Shaoxing Zhejiang 312000, P.R. China

### Arrangements And Duality

Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,

### Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

### Ph.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor

Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai

### 136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics

### ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS

ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS M. AXTELL, J. COYKENDALL, AND J. STICKLES Abstract. We recall several results of zero divisor graphs of commutative rings. We

### Extremal Wiener Index of Trees with All Degrees Odd

MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (2013) 287-292 ISSN 0340-6253 Extremal Wiener Index of Trees with All Degrees Odd Hong Lin School of

### Ramsey numbers for bipartite graphs with small bandwidth

Ramsey numbers for bipartite graphs with small bandwidth Guilherme O. Mota 1,, Gábor N. Sárközy 2,, Mathias Schacht 3,, and Anusch Taraz 4, 1 Instituto de Matemática e Estatística, Universidade de São

### All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

### Special Classes of Divisor Cordial Graphs

International Mathematical Forum, Vol. 7,, no. 35, 737-749 Special Classes of Divisor Cordial Graphs R. Varatharajan Department of Mathematics, Sri S.R.N.M. College Sattur - 66 3, Tamil Nadu, India varatharajansrnm@gmail.com

### A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

### P. Jeyanthi and N. Angel Benseera

Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONE-POINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel

### Institut für Informatik Lehrstuhl Theoretische Informatik I / Komplexitätstheorie. An Iterative Compression Algorithm for Vertex Cover

Friedrich-Schiller-Universität Jena Institut für Informatik Lehrstuhl Theoretische Informatik I / Komplexitätstheorie Studienarbeit An Iterative Compression Algorithm for Vertex Cover von Thomas Peiselt

### Uniform Multicommodity Flow through the Complete Graph with Random Edge-capacities

Combinatorics, Probability and Computing (2005) 00, 000 000. c 2005 Cambridge University Press DOI: 10.1017/S0000000000000000 Printed in the United Kingdom Uniform Multicommodity Flow through the Complete

### BOUNDARY EDGE DOMINATION IN GRAPHS

BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 0-4874, ISSN (o) 0-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(015), 197-04 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA

### Degree-associated reconstruction parameters of complete multipartite graphs and their complements

Degree-associated reconstruction parameters of complete multipartite graphs and their complements Meijie Ma, Huangping Shi, Hannah Spinoza, Douglas B. West January 23, 2014 Abstract Avertex-deleted subgraphofagraphgisacard.

### Removing even crossings

Removing even crossings Michael J. Pelsmajer a, Marcus Schaefer b, Daniel Štefankovič c a Department of Applied Mathematics, Illinois Institute of Technology, Chicago, IL 60616, USA b Department of Computer

### 3. Eulerian and Hamiltonian Graphs

3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from

### Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information

Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information Lawrence Ong School of Electrical Engineering and Computer Science, The University of Newcastle, Australia Email: lawrence.ong@cantab.net

### Class One: Degree Sequences

Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of

### Small Maximal Independent Sets and Faster Exact Graph Coloring

Small Maximal Independent Sets and Faster Exact Graph Coloring David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science The Exact Graph Coloring Problem: Given an undirected

### On the Modes of the Independence Polynomial of the Centipede

47 6 Journal of Integer Sequences, Vol. 5 0), Article.5. On the Modes of the Independence Polynomial of the Centipede Moussa Benoumhani Department of Mathematics Faculty of Sciences Al-Imam University

### Global secure sets of trees and grid-like graphs. Yiu Yu Ho

Global secure sets of trees and grid-like graphs by Yiu Yu Ho B.S. University of Central Florida, 2006 M.S. University of Central Florida, 2010 A dissertation submitted in partial fulfillment of the requirements

### MINIMUM VERTEX DEGREE CONDITIONS FOR LOOSE HAMILTON CYCLES IN 3-UNIFORM HYPERGRAPHS., where

MINIMUM VERTEX DEGREE CONDITIONS FOR LOOSE HAMILTON CYCLES IN -UNIFORM HYPERGRAPHS ENNO BUSS, HIỆP HÀN, AND MATHIAS SCHACHT Abstract. We investigate minimum vertex degree conditions for -uniform hypergraphs

### CS311H. Prof: Peter Stone. Department of Computer Science The University of Texas at Austin

CS311H Prof: Department of Computer Science The University of Texas at Austin Good Morning, Colleagues Good Morning, Colleagues Are there any questions? Logistics Class survey Logistics Class survey Homework

### Research Statement. Andrew Suk

Research Statement Andrew Suk 1 Introduction My research interests are combinatorial methods in discrete geometry. In particular, I am interested in extremal problems on geometric objects. My research

### arxiv:1203.1525v1 [math.co] 7 Mar 2012

Constructing subset partition graphs with strong adjacency and end-point count properties Nicolai Hähnle haehnle@math.tu-berlin.de arxiv:1203.1525v1 [math.co] 7 Mar 2012 March 8, 2012 Abstract Kim defined

### Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices

MATHEMATICAL COMMUNICATIONS 47 Math. Commun., Vol. 15, No. 2, pp. 47-58 (2010) Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices Hongzhuan Wang 1, Hongbo Hua 1, and Dongdong Wang

### V. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005

V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer

### Generalized Induced Factor Problems

Egerváry Research Group on Combinatorial Optimization Technical reports TR-2002-07. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.

### On parsimonious edge-colouring of graphs with maximum degree three

On parsimonious edge-colouring of graphs with maximum degree three Jean-Luc Fouquet, Jean-Marie Vanherpe To cite this version: Jean-Luc Fouquet, Jean-Marie Vanherpe. On parsimonious edge-colouring of graphs

### On the Relationship between Classes P and NP

Journal of Computer Science 8 (7): 1036-1040, 2012 ISSN 1549-3636 2012 Science Publications On the Relationship between Classes P and NP Anatoly D. Plotnikov Department of Computer Systems and Networks,

### R u t c o r Research R e p o r t. Boolean functions with a simple certificate for CNF complexity. Ondřej Čepeka Petr Kučera b Petr Savický c

R u t c o r Research R e p o r t Boolean functions with a simple certificate for CNF complexity Ondřej Čepeka Petr Kučera b Petr Savický c RRR 2-2010, January 24, 2010 RUTCOR Rutgers Center for Operations

### ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove

### SCORE SETS IN ORIENTED GRAPHS

Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in

### Local search for the minimum label spanning tree problem with bounded color classes

Available online at www.sciencedirect.com Operations Research Letters 31 (003) 195 01 Operations Research Letters www.elsevier.com/locate/dsw Local search for the minimum label spanning tree problem with

### Asymptotically Faster Algorithms for the Parameterized face cover Problem

Asymptotically Faster Algorithms for the Parameterized face cover Problem Faisal N. Abu-Khzam 1, Henning Fernau 2 and Michael A. Langston 3 1 Division of Computer Science and Mathematics, Lebanese American

### HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

### Computer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

- 1 - THREE TREE-PATHS Avram Zehavi Alon Itai Computer Science Department Technion - IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

### A Sublinear Bipartiteness Tester for Bounded Degree Graphs

A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite

### Natural realizations of sparsity matroids

Abstract Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 4 (2011) 141 151 Natural realizations of sparsity matroids Ileana

### most 4 Mirka Miller 1,2, Guillermo Pineda-Villavicencio 3, The University of Newcastle Callaghan, NSW 2308, Australia University of West Bohemia

Complete catalogue of graphs of maimum degree 3 and defect at most 4 Mirka Miller 1,2, Guillermo Pineda-Villavicencio 3, 1 School of Electrical Engineering and Computer Science The University of Newcastle

### Coloring a set of touching strings

Coloring a set of touching strings Louis Esperet Daniel Gonçalves Arnaud Labourel Abstract For a family of geometric objects in the plane F = {S 1,..., S n }, define χ(f) as the least integer l such that

### 8.1 Min Degree Spanning Tree

CS880: Approximations Algorithms Scribe: Siddharth Barman Lecturer: Shuchi Chawla Topic: Min Degree Spanning Tree Date: 02/15/07 In this lecture we give a local search based algorithm for the Min Degree

### Collinear Points in Permutations

Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,

### On the maximum average degree and the incidence chromatic number of a graph

Discrete Mathematics and Theoretical Computer Science DMTCS ol. 7, 2005, 203 216 On the maximum aerage degree and the incidence chromatic number of a graph Mohammad Hosseini Dolama 1 and Eric Sopena 2

### Tree sums and maximal connected I-spaces

Tree sums and maximal connected I-spaces Adam Bartoš drekin@gmail.com Faculty of Mathematics and Physics Charles University in Prague Twelfth Symposium on General Topology Prague, July 2016 Maximal and

### Every tree contains a large induced subgraph with all degrees odd

Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University