Coloring Squared Rectangles
|
|
- Howard Wells
- 5 years ago
- Views:
Transcription
1 Coloring Squared Rectangles Mark Bun August 28, 2010 Abstract We investigate the 3-colorability of rectangles dissected into squares. Our primary result is a polynomial-time algorithm for deciding whether a member of a large class of squared rectangles is 3-colorable, which runs in linear time for most squarings. We also give partial results in using the graph of the electrical network corresponding to a squared rectangle to decide its 3-colorability. Contents 1 Introduction 2 2 Preliminary Definitions 2 3 Graphs with Short Cycles Partial Wheels and Wheels Near-Triangulations A Crude Coloring Algorithm Coloring the Adjacency Graph 7 5 Colorability from the P-net Coloring Medial Graphs
2 1 Introduction Graph coloring problems are of great interest to mathematicians and computer scientists. One of the most significant achievements in twentieth century mathematics was the 1976 proof of the four-color theorem any planar graph admits a vertex coloring with four colors. Despite this positive result, it remains NPcomplete to decide whether four is the fewest number of colors needed to color a planar graph, or if three suffice. Of course, there are certain proper subclasses of the planar graphs for which the problem of 3-colorability is still NP-complete, as well as subclasses for which the problem is very easy. Examples of each are given in this paper. Another problem, reminisicent of recreational mathematics, is that of squaring the rectangle. Given a rectangle, the problem is to dissect it into a finite number of non-overlapping squares called elements. A dissection into n squares is called a squaring of order n. This problem becomes interesting when we place certain restrictions on the nature of the squaring a perfect squaring is one where each element has a different size, and a compound squaring is one where some proper subset of elements is itself a rectangle. A squaring that is not compound is simple. The main theoretical insight on squared rectangles, presented in [2], came from four undergraduates at Cambridge. The Cambridge students associated each squared rectangle to a discrete electrical network. Subsequent papers have shown that this seems to be the right way to think about the problem. In this paper, we merge ideas from these two problems and examine the colorability of squared rectangles. We first give an algorithm that decides whether a squared rectangle admits a 3-coloring. We then investigate whether we can use the underlying electrical network to solve this problem combinatorially. 2 Preliminary Definitions A plane graph G = (V, E) is a graph that has been embedded in the plane. That is, its vertices V are points in the plane and its edge set E consists of non-interesecting simple curves. A planar graph is one which is isomorphic to a plane graph. A simple graph has no self-loops or multi-edges (more than one edge between a pair of vertices). A k-coloring of a graph G = (V, E) is a mapping f : V {1,..., k} such that if G has an edge from u to v, then f(u) f(v). Sometimes we will take the codomain of f to be an actual set of colors. We say that G is k-colorable if it admits a k-coloring. A k-coloring f : V {1,..., k} is unique if every k coloring of G takes the form σ f for some permutation σ of {1,..., k}. The chromatic number χ(g) is the smallest k such that G is k-colorable. By a region of R 2, we mean an arc-connected subset. A face of a plane graph G is a maximal region R such that any pair of points on the interior of R is connected by a path that does not intersect an edge of G. A finite plane graph has exactly one unbounded face, which we will call its outer face. 2
3 Let v be a vertex of a graph G. The closed neighborhood N G [v] is the induced subgraph of G on v and its neighbors. Henceforth, we will simply use the term neighborhood and drop the subscript G when the graph in question is known. Finally, let d G (v) denote the degree of a vertex v in G. 3 Graphs with Short Cycles 3.1 Partial Wheels and Wheels In the next section, we will look at near-triangulations, which form a broad class of graphs which are easy to color. The building blocks of these graphs are partial wheels and wheels, in the sense that the neighborhood of each vertex in a near-triangulation is one of these objects. We present a few results on partial wheels and wheels which will simplify the proofs in later sections. Interestingly, wheel graphs create a subtlety in the algorithmic enumeration of simple squared rectangles; see [6] which points to the original theorem in [7]. Definition 1. Let n 3. A partial wheel of order n is a planar graph consisting of a hub vertex v connected to vertices v 1,..., v n, with additional edges v i v i+1 for 1 i < n. A wheel of order n is a partial wheel of order n where the vertices v 1 and v n are identified. Figure 1: Partial wheel and wheel of order 7 Lemma 3.1. Let P n be a partial wheel of order n. Then P n has a unique 3-coloring f where f(v) = 1 and { 2 if i is odd f(v i ) = 3 if i is even. 3
4 Proof. We uniquely determine the 3-coloring f. Suppose without loss of generality that f(v) = 1, f(v 1 ) = 2. The vertices of vv 1 v 2 must have distinct colors, so we must set f(v 2 ) = 3. Similarly, the vertices of vv 2 v 3 must have distinct colors, so we are forced to set f(v 3 ) = 2. The claim follows by induction on i. Corollary 3.2. Let W n be a wheel of order n. If n is even, then W n is not 3-colorable. If n is odd, then W n has a unique 3-coloring. Proof. Let n be even and suppose W n has a 3-coloring f. Then by Lemma 3.1, f(v 1 ) = 2 while f(v n ) = 3, which is a contradiction since we identify v 1 with v n. If n is odd, we can safely do this identification and the result in Lemma 3.1 carries over exactly. 3.2 Near-Triangulations Versions of the definitions and results in this section are given in [5]. Definition 2. A triangulation is a plane graph where every face is a triangle (bounded by a 3-cycle and having no vertices in its interior). Definition 3. A near-triangulation is a biconnected simple plane graph where all but at most one face is a triangle. Without loss of generality, we can take the nontriangular face of a neartriangulation G to be the outer face. The biconnectivity of G implies that every face, in particular the outer face, is bounded by a simple cycle. Call the vertices on the outer cycle the boundary vertices of G, and let the remaining vertices be interior vertices. We make one more definition: Definition 4. A near-triangulation is internally even if every interior vertex has even degree. We are now ready to give our most useful result on coloring. Theorem 3.3. Let G be a near-triangulation. i. If G is not internally even, then χ(g) = 4. ii. If G is internally even, then G has a unique 3-coloring. This is an extension of a result in [5], which follows from Heawood s corresponding result for triangulations. Unfortunately, I was unable to locate Heawood s paper, so this proof will have to suffice. Proof (i). Suppose G is not internally even. Let v be an interior vertex of G with degree 2n + 1. Since G s interior is triangulated, the neighborhood N[v] is a wheel of order 2n + 2. By Corollary 3.2, N[v] is not 3-colorable, so G is not 3-colorable. However, by the four-color theorem, G is 4-colorable so χ(g) = 4. 4
5 The proof of the second part is by way of a coloring algorithm that builds up 3-colored subgraphs of G. To simplify the algorithm, we define the primary operation we will use to construct these subgraphs. Definition 5. Let G be a near-triangulation with m-valent boundary vertex v. Suppose v is adjacent to boundary vertices u and w so that u, v and w are in clockwise order when traversing the boundary cycle of G. A k-interiorization G of G with respect to v is a graph obtained by adding vertices v 1,..., v k m in clockwise order on some arc from u to w in the outer face of G, as well as the edges wv 1, v k m u, v i v i+1 for 1 i < k m and vv j for 1 j k m. Observe that v is no longer a boundary vertex of G, but each v i, u and w are. Lemma 3.4. Let G be a near-triangulation with unique 3-coloring f. Let G be the graph obtained by 2k-interiorizing some boundary vertex v of G. Then G is a near-triangulation with a unique 3-coloring. Proof. The resulting graph G is clearly biconnected, and since the added faces are triangular, G is a near-triangulation. The neighborhood N G [v] is a wheel graph of order 2k + 1, so by Corollary 3.2, it has a unique 3-coloring. Since the colors of N G [v] must match up with the colors of v and its neighbors in G (of which there are at least 2), this extended coloring is completely determined by f(g). Observe that Lemma 3.4 holds in slightly more generality when we consider partial interiorizations. That is, instead of replacing the neighborhood of a vertex v with a wheel graph, we replace it with a partial wheel graph so that it remains a boundary vertex. A slight ammendment of the proof of Lemma 3.4 gives the same result for all (i.e., not necessarily even) partial interiorizations of a boundary vertex. Lemma 3.5. Let G and H be near-triangulations where H is a strict subgraph of G such that G \ H has no vertices or edges in the interior of H. Then there is a boundary vertex of H that can be interiorized or partially interiorized to give a strictly larger subgraph of G. Proof. Let v 1 be a boundary vertex of H where d H (v 1 ) < d G (v 1 ). Such a vertex exists since H is a strict subgraph of G and the interior vertices of H have exactly the same degree as they do in G. Suppose d G (v 1 ) = k. If the k-interiorization of H (or some partial interiorization) with respect to v 1 is a subgraph of G, we are done. Otherwise, there must be some boundary vertex of H, say v m, where v 1 v m is an edge in G but not an edge in H. This edge partitions off some cycle C = v m, v 1, v 2,..., v m 1, v m, v 1 on the interior of G, where v 1, v 2,..., v m are consecutive boundary nodes of H. Since the interior of G is triangulated, G has some edge v i v i+2. If we produce a new graph H by adding v i v i+2 to H, then v i+1 is an interior vertex of H. Hence H is a (nearly trivial) interiorization of H with respect to v i+1. Proof (ii). By induction on Lemma 3.5, we can form G by starting with K 3 and repeatedly applying interiorizations and partial interiorizations. If we color the 5
6 graph in each iteration according to Lemma 3.4, the final result is the unique 3-coloring of G. 3.3 A Crude Coloring Algorithm Consider a simple cycle C n of length n. We define a set of graphs T χ (n), the so-called χ-triangulations of C n, recursively as follows. 1. T χ (3) = {C 3 }. 2. The wheel W 5 is in T χ (4). 3. Let v 1 and v 2 be two non-adjacent vertices in C n ; connect them with an edge. This induces two shorter cycles C i and C j. Apply a triangulation from T χ (i) to C i and a triangulation from T χ (j) to C j. The resulting graph is in T χ (n). We now justify the name of this family of sets. First, it is immediately clear that each graph in T χ (n) is a near-triangulation. The next lemma gives the connection with coloring. Lemma 3.6. Let f be a 3-coloring of C n for n 3 (obviously at least one exists). Then there is member of T χ (n) with a 3-coloring that agrees with f on C n. Proof. Label the vertices of C n, in order, as v 1,..., v n. If n = 3, we are done. Suppose n = 4. Then one 3-coloring of C 4 is f(v 1 ) = f(v 3 ) = 1 and f(v 2 ) = f(v 4 ) = 2. In this case, W 5 T χ (4) and we can color the hub v in W 5 with color 3. The other 3-coloring is given by f(v 1 ) = 1, f(v 2 ) = 2, f(v 3 ) = 3 and f(v 4 ) = 2. The graph obtained by connecting v 1 to v 3 is in T χ (4), so we are done with this case. Now suppose n 5. Suppose as our inductive hypothesis that Lemma 3.6 holds for 3 k < n. We claim that there is a non-adjacent pair of vertices on C n that have different colors. Suppose f(v 1 ) = 1 and f(v 2 ) = 2. Then f(v 3 ) = 1 or 3. If f(v 3 ) = 3, then v 1 and v 3 have different colors as desired. If f(v 3 ) = 1, then f(v 4 ) = 2 or 3. In either case, v 1 and v 4 have different colors. Note that since n 5, the vertices we have produced are non-adjacent. Connecting these vertices produces two smaller cycles. By the inductive hypothesis, each has a χ-triangulation with a 3-coloring that agrees with f. By our definition, the graph resulting from these triangulations is in T χ (n). The consequence is that in a 3-colorable graph G where the boundary of every face is a cycle, there is a 3-colorable near-triangulation obtained by χ- triangulating each face of G. More formally, we give the following algorithm for deciding whether, say a biconnected graph, is 3-colorable: 6
7 Algorithm 1 3-colorability of biconnected planar graph G number the interior simple cycles of G of length 4 with i {1,..., n} let k i be the length of cycle i for H T χ (k 1 ) T χ (k 2 ) T χ (k n ) do set G to be G with its cycles replaced by the components of H if G is internally even then return accept end if end for return reject This algorithm takes an exponential (2 O(nc) for constant c) amount of time for general planar graphs: For each additional simple cycle of length k in G, the number of times the algorithm checks internal evenness increases by a factor of T χ (k). The number of χ-triangulations of C k is (tightly) bounded from below by the number of triangulations of a convex polygon on k vertices, which is known to be the (k 2)nd Catalan number. The Catalan numbers increase exponentially, which gives this running time. However, if we restrict the graphs we examine to those with few cycles of constantly bounded length, this algorthm becomes reasonably efficient. Lemma 3.7. Algorithm 1 runs in polynomial time for planar graphs on n vertices where 1. The length of each interior simple cycle is bounded by a constant k. 2. The number of interior simple cycles of length > 3 is O(log n). Proof. Let b = T χ (k). Then the number of graphs H we need to check in Algorithm 1 is bounded by for some constant c. b O(log n) = n c log b 4 Coloring the Adjacency Graph With these results on near-triangulations in hand, it is easy to analyze the behavior of squared rectangles by examining the properties of equivalent graphs. Definition 6. Let R be a squared rectangle. The adjacency graph A(R) has a vertex for every element in R, and an edge between two vertices if the corresponding elements in R are adjacent. Clearly R is k-colorable if and only if A(R) is also k-colorable. Obviously A(R) is a connected planar graph, so by the four-color theorem, a squared rectangle is always 4-colorable. 7
8 Definition 7. Let R be a squared rectangle. A cross of R is an intersection point of four of its elements. A cut element of R is an element whose removal disconnects R. Theorem 4.1. Let R be a squared rectangle with no crosses or cut elements. Then A(R) is a near-triangulation. Proof. The exclusion of cut elements implies that the removal of any single vertex from A(R) results in a a connected graph, so A(R) is biconnected. The boundary elements of R form a cycle, which in turn induces the outer face of A(R). We now show that the outer face is the only non-triangular face of A(R). Suppose X and Y are adjacent elements of R, and without loss of generality, X is stacked on top of Y. Further suppose that at least one has a left side that does not coincide with the boundary of R, and at least one has a right side that does not coincide with the boundary of R. Consider the interface between the left side of X and the left side of Y. Up to relabeling, we have two cases: Case 1: The left side of X and the left side of Y form a single vertical line segment. Suppose the left side of X does not coincide with the boundary of R, so there is at least one element of R adjacent to the left side of X. Let Z be the lowest such element. Suppose Z is not adjacent to Y. Then the bottom side of Z forms a single horizontal line segment with the bottom side of X, which clearly induces a cross. Hence Z is adjacent to Y, so there is a triangular face XY Z in A(R). Figure 2: Case 2 Case 2: The left side of X is strictly to the left (or to the right) of the left side of Y. In this case, some element Z must occupy the corner indicated in Figure 2. In this case as well, X, Y and Z form a triangle in A(R). We can repeat this analysis for the right sides of X and Y. The result is that the edge XY in A(R) is incident to two triangular faces. Via rotation, this shows that every edge of A(R) not on the boundary cycle is also incident to two triangular faces. Now consider the case where X and Y are adjacent on the boundary of R; say their right sides both coincide with the right side of R. Since we are disallowing cut elements, either Case 1 or Case 2 applies to the left sides of X and Y. Therefore, the interior face incident to XY on A(R) is a triangle, and the other face is just the outer face. 8
9 Corollary 4.2. If R is a squared rectangle with no crosses or cut elements, then A(R) is colorable if and only if it is internally even. It turns out that dealing with cut elements does not make our coloring problem significantly harder. A cut element of a squared rectangle must either coincide with both the top and bottom boundaries, or with both the left and right boundaries. In any particular squaring, it is impossible to have cut elements of both types. Therefore, without loss of generality, we can assume that the cut elements of a squared rectangle all coincide with its top and bottom. This translates to an easy dissection of the corresponding adjacency graph into biconnected components as in Figure 3. Figure 3: A(R) split into biconnected components As a consequence of our ability to express A(R) as this chain of biconnected components, A(R) is 3-colorable if and only if each component is 3-colorable. Since locating biconnected components takes polynomial time, a polynomialtime algorithm for biconnected graphs translates into one for general graphs. Now we handle the case where R has no cut vertices, but perhaps has crosses. By the proof of 4.1, the crosses in R are in direct correspondence with interior 4-cycles in A(R). Hence one option for deciding the 3-colorability of A(R) is to use our techniques from section 3.3. However, we can also define an even broader class of squared rectangles for which we can determine 3-colorability in polynomial time. Theorem 4.3. Consider the class of squared rectangles where each element is incident to at most two crosses. We can decide 3-colorability for this class in polynomial time. Proof. The proof is again by way of an algorithm. We build a boolean formula ψ in conjunctive normal form which is satisfiable if and only if some χ-triangulation of G is internally even. Fix a numbering C 1,..., C k of the 4-cycles of G = A(R). For each C i, associate variables x i and y i which represent the cycle s diagonals. This induces a correspondence between the χ-triangulations of C i and boolean formulas as in Figure 4. Hence C i has been χ-triangulated if and only if x i y i is satisfied, so we start by letting φ(x 1, y 1,..., x k, y k ) = i (x i y i ). 9
10 (a) x ȳ (b) x y (c) x y Figure 4: Correspondence with formulas Let G (x 1, y 1,..., x k, y k ) be the χ-triangulation of G corresponding to a satisfying assignment to φ. Internal evenness imposes additional logical constraints in terms of these variables. Set ψ = φ. Consider an interior vertex v. We have three cases. Case 1: Vertex v is incident to no 4-cycles. Then if our χ-triangulation is internally even, d G (v) must be even. We can therefore append 1 to (AND 1 with) ψ if d G (v) is even and 0 to ψ if it is odd. Case 2: Vertex v is incident to exactly one 4-cycle. Suppose the diagonal of this 4-cycle that is incident to v is z i. If d G (v) is even, then d G (v) is even if and only if z i = 0, so we append z i to ψ. Similarly, if d G (v) is odd, we append z i to ψ. Case 3: Vertex v is incident to exactly two 4-cycles. Let z i and w i be the diagonals incident to v. If d G (v) is even, then d G (v) is even if and only if z i = w i, or equivalently, (z i w i ) ( z i w i ). If d G (v) is odd, we append z i w i, or (z i w i ) ( z i w i ). The result is a 2-CNF formula ψ which is satisfiable if and only if G is internally even. Since ψ has a polynomial number of clauses, and 2SAT P, we can determine whether G is 3-colorable in polynomial time. Since simple, perfect squarings tend to have very few crosses, this result is probably sufficient for all intents and purposes with these squarings. The restriction on the number of crosses incident to each element seems necessary for this proof method to work. If an element is incident to 3 or 4 crosses (clearly 4 is the maximum), then the corresponding CNF we must append to ψ has no obvious equisatisfiable 2-CNF counterpart. It remains possible that coloring general squared rectangles is NP-complete; it would be of great interest to determine whether this is the case. 5 Colorability from the P-net In [2], the Cambridge students observed a correspondence between squared rectangles and resistor networks called p-nets (short for polar nets). The underly- 10
11 ing graph of a p-net consists of two boundary vertices called poles connected through interior vertices. The edges of the graph correspond to unit resistors. A positive voltage is impressed at one pole and a voltage of zero is impressed at the other. The resulting currents through the resistors are the sizes of the elements in the corresponding squared rectangle. Let P be a p-net and let R(P ) be its corresponding squared rectangle. Since P provides a succint representation of R(P ), we would ideally like to directly use P to determine the 3-colorability of R(P ). That is, while we could just compute currents to obtain R(P ) from P and use the results of the previous section, it would be interesting to see what information we can get just combinatorially. Our primary tool for understanding P is its medial graph. We follow the construction in [3]. Let M(P ) be the simplified medial graph of P, which is obtained from the medial graph of P by contracting its boundary spikes and removing its parallel edges and self-loops. Theorem 5.1. Let P be a p-net in the normal form of [2] corresponding to squared rectangle R. Then M(P ) is a subgraph of A(R) with an identical vertex set. Proof. Since P is in normal form, its currents are all nonzero so R has an element, and hence A(R) has a vertex, for every edge in P. Let uv be an edge in M(P ). Then the edges u and v are adjacent in a simple cycle of P. The simple cycles of P compress to vertical line segments in R, so u and v are adjacent in R and therefore A(R). Implicit in this result is that, in the case where R has no crosses, A(R) is just a near-triangulation of M(P ). The extra edges come from squares that are adjacent via the vertical line segments in R. As far as I know, the only way to determine these additional adjacencies is to compute the currents in P. Since the process of simplifying a medial graph does not affect 3-colorability, we have Corollary 5.2. If the medial graph of P is not 3-colorable, then R(P ) is not 3-colorable. 5.1 Coloring Medial Graphs We would like to be able to use Corollary 5.2 to give an easily computable necessary condition for 3-colorability of a squared rectangle. Unfortunately, there probably isn t one. The theorem in this section is a consequence of the following result from [4]. Lemma colorability of 4-regular simple, planar graphs is NP-complete. The proof of this fact itself follows from a chain of reductions given in [4] and its references. Theorem 5.4. For k 0, 3-colorability is NP-complete for medial graphs on exactly 2k 1-valent nodes. 11
12 Proof. Like almost all 3-coloring problems, this one is obviously is in NP. Fix k 0. We give a polynomial-time reduction that makes use of Lemma 5.3. Let G be a 4-regular simple, planar graph. In linear time, we can compute a planar embedding for G (consult, for instance, [1]). Let v be a vertex on the outer face of G. Without loss of generality, v and its four (distinct) neighbors are positioned as in Figure 5. Figure 5: Configuration before transformation Figure 6: Configuration after transformation Let G be the graph obtained by replacing the configuration in Figure 5 with the one in Figure 6. If G is 3-colorable, then if we let the green in Figure 6 represent the color assigned to v, we have a 3-coloring of G as well. It is easy to see that the red, yellow, and green 3-coloring of the gadget in Figure 6 is unique; in particular, the green vertices must all have the same color. Therefore, a 3- coloring of G can be compressed into a 3-coloring of G. Note that G has two additional 4-valent nodes on its exterior face. Hence, we can repeatedly apply this transformation to these new exterior vertices k times. This yields a medial graph on 2k 1-valent vertices that is 3-colorable if and only if G is 3-colorable. 12
13 References [1] J. M. Boyer and W. J. Myrvold, On the cutting edge: simplified O(n) planarity by edge addition, J. Graph Algorithms Appl. (3) 8 (2004) [2] R. L. Brooks, C. A. B. Smith, A. H. Stone, and W. T. Tutte, The dissection of rectangles into squares, Duke Math. J. 7 (1940) [3] E. Curtis and J. Morrow, Inverse Problems for Electrical Networks, Series on Applied Mathematics, World Scientific, [4] D. P. Dailey, Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete, Discrete Math. 30 (1980) [5] K. Diks, L. Kowalik, and M. Kurowsi, A new 3-color criterion for planar graphs. (English summary) Graph-theoretic concepts in computer science , Lecture Notes in Comput. Sci., 2573, Springer, Berlin, [6] N. D. Kazarinoff and R. Weitzenkamp, Squaring Rectangles and Squares. Amer. Math. Monthly (8) 80 (1973) [7] W. T. Tutte, A theory of 3-connected graphs. Indag. Math. 23 (1961)
Math 443/543 Graph Theory Notes 5: Planar graphs and coloring
Math 443/543 Graph Theory Notes 5: Planar graphs and coloring David Glickenstein October 10, 2014 1 Planar graphs The Three Houses and Three Utilities Problem: Given three houses and three utilities, can
More informationMath 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem
Math 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem David Glickenstein November 26, 2008 1 Graph minors Let s revisit some de nitions. Let G = (V; E) be a graph. De nition 1 Removing
More informationPlanar graphs. Math Prof. Kindred - Lecture 16 Page 1
Planar graphs Typically a drawing of a graph is simply a notational shorthand or a more visual way to capture the structure of the graph. Now we focus on the drawings themselves. Definition A drawing of
More information1 Definition of Reduction
1 Definition of Reduction Problem A is reducible, or more technically Turing reducible, to problem B, denoted A B if there a main program M to solve problem A that lacks only a procedure to solve problem
More informationPlanar graphs. Chapter 8
Chapter 8 Planar graphs Definition 8.1. A graph is called planar if it can be drawn in the plane so that edges intersect only at vertices to which they are incident. Example 8.2. Different representations
More information8 Colouring Planar Graphs
8 Colouring Planar Graphs The Four Colour Theorem Lemma 8.1 If G is a simple planar graph, then (i) 12 v V (G)(6 deg(v)) with equality for triangulations. (ii) G has a vertex of degree 5. Proof: For (i),
More informationA THREE AND FIVE COLOR THEOREM
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 52, October 1975 A THREE AND FIVE COLOR THEOREM FRANK R. BERNHART1 ABSTRACT. Let / be a face of a plane graph G. The Three and Five Color Theorem
More informationPartitions and Packings of Complete Geometric Graphs with Plane Spanning Double Stars and Paths
Partitions and Packings of Complete Geometric Graphs with Plane Spanning Double Stars and Paths Master Thesis Patrick Schnider July 25, 2015 Advisors: Prof. Dr. Emo Welzl, Manuel Wettstein Department of
More informationLecture 3: Art Gallery Problems and Polygon Triangulation
EECS 396/496: Computational Geometry Fall 2017 Lecture 3: Art Gallery Problems and Polygon Triangulation Lecturer: Huck Bennett In this lecture, we study the problem of guarding an art gallery (specified
More informationExercise set 2 Solutions
Exercise set 2 Solutions Let H and H be the two components of T e and let F E(T ) consist of the edges of T with one endpoint in V (H), the other in V (H ) Since T is connected, F Furthermore, since T
More informationVertex 3-colorability of claw-free graphs
Algorithmic Operations Research Vol.2 (27) 5 2 Vertex 3-colorability of claw-free graphs Marcin Kamiński a Vadim Lozin a a RUTCOR - Rutgers University Center for Operations Research, 64 Bartholomew Road,
More informationMath 777 Graph Theory, Spring, 2006 Lecture Note 1 Planar graphs Week 1 Weak 2
Math 777 Graph Theory, Spring, 006 Lecture Note 1 Planar graphs Week 1 Weak 1 Planar graphs Lectured by Lincoln Lu Definition 1 A drawing of a graph G is a function f defined on V (G) E(G) that assigns
More informationThe Geodesic Integral on Medial Graphs
The Geodesic Integral on Medial Graphs Kolya Malkin August 013 We define the geodesic integral defined on paths in the duals of medial graphs on surfaces and use it to study lens elimination and connection
More informationON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE**
Chin. Ann. of Math. 23B:(2002),87-9. ON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE** XU Changqing* DING Ren* Abstract The authors discuss the partition of a finite set of points in the plane
More informationDiscrete Mathematics I So Practice Sheet Solutions 1
Discrete Mathematics I So 2016 Tibor Szabó Shagnik Das Practice Sheet Solutions 1 Provided below are possible solutions to the questions from the practice sheet issued towards the end of the course. Exercise
More informationEvery planar graph is 4-colourable and 5-choosable a joint proof
Peter Dörre Fachhochschule Südwestfalen (University of Applied Sciences) Frauenstuhlweg, D-58644 Iserlohn, Germany doerre@fh-swf.de Mathematics Subject Classification: 05C5 Abstract A new straightforward
More informationPaths, Flowers and Vertex Cover
Paths, Flowers and Vertex Cover Venkatesh Raman M. S. Ramanujan Saket Saurabh Abstract It is well known that in a bipartite (and more generally in a König) graph, the size of the minimum vertex cover is
More informationGraphs and Discrete Structures
Graphs and Discrete Structures Nicolas Bousquet Louis Esperet Fall 2018 Abstract Brief summary of the first and second course. É 1 Chromatic number, independence number and clique number The chromatic
More informationJordan Curves. A curve is a subset of IR 2 of the form
Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0, 1]}, where γ : [0, 1] IR 2 is a continuous mapping from the closed interval [0, 1] to the plane. γ(0) and γ(1) are called the endpoints
More informationOn the Relationships between Zero Forcing Numbers and Certain Graph Coverings
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,
More informationarxiv: v1 [cs.cc] 2 Sep 2017
Complexity of Domination in Triangulated Plane Graphs Dömötör Pálvölgyi September 5, 2017 arxiv:1709.00596v1 [cs.cc] 2 Sep 2017 Abstract We prove that for a triangulated plane graph it is NP-complete to
More informationJordan Curves. A curve is a subset of IR 2 of the form
Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0,1]}, where γ : [0,1] IR 2 is a continuous mapping from the closed interval [0,1] to the plane. γ(0) and γ(1) are called the endpoints
More informationFixed-Parameter Algorithms, IA166
Fixed-Parameter Algorithms, IA166 Sebastian Ordyniak Faculty of Informatics Masaryk University Brno Spring Semester 2013 Introduction Outline 1 Introduction Algorithms on Locally Bounded Treewidth Layer
More informationCOLORING EDGES AND VERTICES OF GRAPHS WITHOUT SHORT OR LONG CYCLES
Volume 2, Number 1, Pages 61 66 ISSN 1715-0868 COLORING EDGES AND VERTICES OF GRAPHS WITHOUT SHORT OR LONG CYCLES MARCIN KAMIŃSKI AND VADIM LOZIN Abstract. Vertex and edge colorability are two graph problems
More informationThe Graphs of Triangulations of Polygons
The Graphs of Triangulations of Polygons Matthew O Meara Research Experience for Undergraduates Summer 006 Basic Considerations Let Γ(n) be the graph with vertices being the labeled planar triangulation
More informationBasics of Graph Theory
Basics of Graph Theory 1 Basic notions A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Simple graphs have their
More informationMa/CS 6b Class 26: Art Galleries and Politicians
Ma/CS 6b Class 26: Art Galleries and Politicians By Adam Sheffer The Art Gallery Problem Problem. We wish to place security cameras at a gallery, such that they cover it completely. Every camera can cover
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More informationIsometric Cycles, Cutsets, and Crowning of Bridged Graphs
Isometric Cycles, Cutsets, and Crowning of Bridged Graphs Tao Jiang, 1 Seog-Jin Kim, 2 and Douglas B. West 3 1 DEPARTMENT OF MATHEMATICS AND STATISTICS MIAMI UNIVERSITY OXFORD, OHIO 45056 E-mail: jiangt@muohio.edu
More informationConnectivity, Graph Minors, and Subgraph Multiplicity
Connectivity, Graph Minors, and Subgraph Multiplicity David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 Tech. Report 92-06 January 10, 1992 Abstract
More informationProblem Set 3. MATH 776, Fall 2009, Mohr. November 30, 2009
Problem Set 3 MATH 776, Fall 009, Mohr November 30, 009 1 Problem Proposition 1.1. Adding a new edge to a maximal planar graph of order at least 6 always produces both a T K 5 and a T K 3,3 subgraph. Proof.
More informationarxiv: v1 [cs.cc] 30 Jun 2017
Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs Erik D. Demaine Mikhail Rudoy arxiv:1706.10046v1 [cs.cc] 30 Jun 2017 Abstract In 2007, Arkin et al. [3] initiated
More informationDiscrete mathematics
Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2017/2018 About this file This file is meant to be a guideline for the lecturer. Many
More informationComputational Geometry
Motivation Motivation Polygons and visibility Visibility in polygons Triangulation Proof of the Art gallery theorem Two points in a simple polygon can see each other if their connecting line segment is
More informationAbstract. A graph G is perfect if for every induced subgraph H of G, the chromatic number of H is equal to the size of the largest clique of H.
Abstract We discuss a class of graphs called perfect graphs. After defining them and getting intuition with a few simple examples (and one less simple example), we present a proof of the Weak Perfect Graph
More informationColoring edges and vertices of graphs without short or long cycles
Coloring edges and vertices of graphs without short or long cycles Marcin Kamiński and Vadim Lozin Abstract Vertex and edge colorability are two graph problems that are NPhard in general. We show that
More informationMa/CS 6b Class 11: Kuratowski and Coloring
Ma/CS 6b Class 11: Kuratowski and Coloring By Adam Sheffer Kuratowski's Theorem Theorem. A graph is planar if and only if it does not have K 5 and K 3,3 as topological minors. We know that if a graph contains
More informationHow many colors are needed to color a map?
How many colors are needed to color a map? Is 4 always enough? Two relevant concepts How many colors do we need to color a map so neighboring countries get different colors? Simplifying assumption (not
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationLecture 6: Graph Properties
Lecture 6: Graph Properties Rajat Mittal IIT Kanpur In this section, we will look at some of the combinatorial properties of graphs. Initially we will discuss independent sets. The bulk of the content
More informationDischarging and reducible configurations
Discharging and reducible configurations Zdeněk Dvořák March 24, 2018 Suppose we want to show that graphs from some hereditary class G are k- colorable. Clearly, we can restrict our attention to graphs
More informationList of Theorems. Mat 416, Introduction to Graph Theory. Theorem 1 The numbers R(p, q) exist and for p, q 2,
List of Theorems Mat 416, Introduction to Graph Theory 1. Ramsey s Theorem for graphs 8.3.11. Theorem 1 The numbers R(p, q) exist and for p, q 2, R(p, q) R(p 1, q) + R(p, q 1). If both summands on the
More informationEULER S FORMULA AND THE FIVE COLOR THEOREM
EULER S FORMULA AND THE FIVE COLOR THEOREM MIN JAE SONG Abstract. In this paper, we will define the necessary concepts to formulate map coloring problems. Then, we will prove Euler s formula and apply
More informationAcyclic Colorings of Graph Subdivisions
Acyclic Colorings of Graph Subdivisions Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, and Md. Saidur Rahman 3 Department of Computer Science, University of Manitoba Department of Computer Science,
More informationOrthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem
Orthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem Pawe l Żyliński Institute of Mathematics University of Gdańsk, 8095 Gdańsk, Poland pz@math.univ.gda.pl Submitted: Sep 9, 005;
More informationThe following is a summary, hand-waving certain things which actually should be proven.
1 Basics of Planar Graphs The following is a summary, hand-waving certain things which actually should be proven. 1.1 Plane Graphs A plane graph is a graph embedded in the plane such that no pair of lines
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,
More informationExact Algorithms Lecture 7: FPT Hardness and the ETH
Exact Algorithms Lecture 7: FPT Hardness and the ETH February 12, 2016 Lecturer: Michael Lampis 1 Reminder: FPT algorithms Definition 1. A parameterized problem is a function from (χ, k) {0, 1} N to {0,
More informationarxiv: v1 [cs.dm] 13 Apr 2012
A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs Vít Jelínek, Jan Kratochvíl, Ignaz Rutter arxiv:1204.2915v1 [cs.dm] 13 Apr 2012 Abstract A partially embedded graph (or Peg) is a triple
More informationExtremal Graph Theory: Turán s Theorem
Bridgewater State University Virtual Commons - Bridgewater State University Honors Program Theses and Projects Undergraduate Honors Program 5-9-07 Extremal Graph Theory: Turán s Theorem Vincent Vascimini
More informationBipartite Roots of Graphs
Bipartite Roots of Graphs Lap Chi Lau Department of Computer Science University of Toronto Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only
More information[8] that this cannot happen on the projective plane (cf. also [2]) and the results of Robertson, Seymour, and Thomas [5] on linkless embeddings of gra
Apex graphs with embeddings of face-width three Bojan Mohar Department of Mathematics University of Ljubljana Jadranska 19, 61111 Ljubljana Slovenia bojan.mohar@uni-lj.si Abstract Aa apex graph is a graph
More informationPlanarity. 1 Introduction. 2 Topological Results
Planarity 1 Introduction A notion of drawing a graph in the plane has led to some of the most deep results in graph theory. Vaguely speaking by a drawing or embedding of a graph G in the plane we mean
More informationMath 776 Graph Theory Lecture Note 1 Basic concepts
Math 776 Graph Theory Lecture Note 1 Basic concepts Lectured by Lincoln Lu Transcribed by Lincoln Lu Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved
More informationLecture Notes on Graph Theory
Lecture Notes on Graph Theory Vadim Lozin 1 Introductory concepts A graph G = (V, E) consists of two finite sets V and E. The elements of V are called the vertices and the elements of E the edges of G.
More informationPart II. Graph Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 53 Paper 3, Section II 15H Define the Ramsey numbers R(s, t) for integers s, t 2. Show that R(s, t) exists for all s,
More informationStraight-Line Drawings of 2-Outerplanar Graphs on Two Curves
Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves (Extended Abstract) Emilio Di Giacomo and Walter Didimo Università di Perugia ({digiacomo,didimo}@diei.unipg.it). Abstract. We study how to
More informationTutte s Theorem: How to draw a graph
Spectral Graph Theory Lecture 15 Tutte s Theorem: How to draw a graph Daniel A. Spielman October 22, 2018 15.1 Overview We prove Tutte s theorem [Tut63], which shows how to use spring embeddings to obtain
More informationMatching and Planarity
Matching and Planarity Po-Shen Loh June 010 1 Warm-up 1. (Bondy 1.5.9.) There are n points in the plane such that every pair of points has distance 1. Show that there are at most n (unordered) pairs of
More informationSmall Survey on Perfect Graphs
Small Survey on Perfect Graphs Michele Alberti ENS Lyon December 8, 2010 Abstract This is a small survey on the exciting world of Perfect Graphs. We will see when a graph is perfect and which are families
More informationAcute Triangulations of Polygons
Europ. J. Combinatorics (2002) 23, 45 55 doi:10.1006/eujc.2001.0531 Available online at http://www.idealibrary.com on Acute Triangulations of Polygons H. MAEHARA We prove that every n-gon can be triangulated
More informationPlanar Graphs. 1 Graphs and maps. 1.1 Planarity and duality
Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter
More informationChordal deletion is fixed-parameter tractable
Chordal deletion is fixed-parameter tractable Dániel Marx Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. dmarx@informatik.hu-berlin.de Abstract. It
More informationOn the packing chromatic number of some lattices
On the packing chromatic number of some lattices Arthur S. Finbow Department of Mathematics and Computing Science Saint Mary s University Halifax, Canada BH C art.finbow@stmarys.ca Douglas F. Rall Department
More informationChapter 6 GRAPH COLORING
Chapter 6 GRAPH COLORING A k-coloring of (the vertex set of) a graph G is a function c : V (G) {1, 2,..., k} such that c (u) 6= c (v) whenever u is adjacent to v. Ifak-coloring of G exists, then G is called
More informationMorphing Planar Graph Drawings
Morphing Planar Graph Drawings Giuseppe Di Battista Università degli Studi Roma Tre The 12th International Conference and Workshops on Algorithms and Computation WALCOM 2018 Basic definitions Graph drawing
More informationAdvanced Combinatorial Optimization September 17, Lecture 3. Sketch some results regarding ear-decompositions and factor-critical graphs.
18.438 Advanced Combinatorial Optimization September 17, 2009 Lecturer: Michel X. Goemans Lecture 3 Scribe: Aleksander Madry ( Based on notes by Robert Kleinberg and Dan Stratila.) In this lecture, we
More informationFinding a -regular Supergraph of Minimum Order
Finding a -regular Supergraph of Minimum Order Hans L. Bodlaender a, Richard B. Tan a,b and Jan van Leeuwen a a Department of Computer Science Utrecht University Padualaan 14, 3584 CH Utrecht The Netherlands
More informationMC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points
MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you
More informationOn the Minimum Number of Spanning Trees in k-edge-connected Graphs
Downloaded from orbit.dtu.dk on: Sep 16, 2018 On the Minimum Number of Spanning Trees in k-edge-connected Graphs Ok, Seongmin; Thomassen, Carsten Published in: Journal of Graph Theory Link to article,
More information751 Problem Set I JWR. Due Sep 28, 2004
751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path
More informationUniversità degli Studi di Roma Tre Dipartimento di Informatica e Automazione Via della Vasca Navale, Roma, Italy
R O M A TRE DIA Università degli Studi di Roma Tre Dipartimento di Informatica e Automazione Via della Vasca Navale, 79 00146 Roma, Italy Non-Convex Representations of Graphs Giuseppe Di Battista, Fabrizio
More informationHamiltonian cycles in bipartite quadrangulations on the torus
Hamiltonian cycles in bipartite quadrangulations on the torus Atsuhiro Nakamoto and Kenta Ozeki Abstract In this paper, we shall prove that every bipartite quadrangulation G on the torus admits a simple
More information9 About Intersection Graphs
9 About Intersection Graphs Since this lecture we focus on selected detailed topics in Graph theory that are close to your teacher s heart... The first selected topic is that of intersection graphs, i.e.
More informationTheorem 2.9: nearest addition algorithm
There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used
More informationAugmenting the Connectivity of Planar and Geometric Graphs
Augmenting the Connectivity of Planar and Geometric Graphs Ignaz Rutter Alexander Wolff Technical Report 2008-3 Fakultät für Informatik, Universität Karlsruhe Abstract In this paper we study some connectivity
More informationOn the Page Number of Upward Planar Directed Acyclic Graphs
Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 17, no. 3, pp. 221 244 (2013) DOI: 10.7155/jgaa.00292 On the Page Number of Upward Planar Directed Acyclic Graphs Fabrizio Frati 1 Radoslav
More informationBar k-visibility Graphs
Bar k-visibility Graphs Alice M. Dean Department of Mathematics Skidmore College adean@skidmore.edu William Evans Department of Computer Science University of British Columbia will@cs.ubc.ca Ellen Gethner
More informationClique trees of infinite locally finite chordal graphs
Clique trees of infinite locally finite chordal graphs Christoph Hofer-Temmel and Florian Lehner Abstract We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is
More informationarxiv: v2 [cs.ds] 7 Jan 2015
Orthogonal Graph Drawing with Inflexible Edges Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter Faculty of Informatics, Karlsruhe Institute of Technology (KIT), Germany arxiv:404.2943v2 [cs.ds] 7 Jan 205
More informationSimultaneous Diagonal Flips in Plane Triangulations
@ _ d j 5 6 5 6 Simultaneous Diagonal Flips in Plane Triangulations Prosenjit Bose Jurek Czyzowicz Zhicheng Gao Pat Morin David R. Wood Abstract Simultaneous diagonal flips in plane triangulations are
More informationConnecting face hitting sets in planar graphs
Connecting face hitting sets in planar graphs Pascal Schweitzer and Patrick Schweitzer Max-Planck-Institute for Computer Science Campus E1 4, D-66123 Saarbrücken, Germany pascal@mpi-inf.mpg.de University
More informationTreewidth and graph minors
Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under
More informationThe Art Gallery Problem: An Overview and Extension to Chromatic Coloring and Mobile Guards
The Art Gallery Problem: An Overview and Extension to Chromatic Coloring and Mobile Guards Nicole Chesnokov May 16, 2018 Contents 1 Introduction 2 2 The Art Gallery Problem 3 2.1 Proof..................................
More informationList Coloring Graphs
List Coloring Graphs January 29, 2004 CHROMATIC NUMBER Defn 1 A k coloring of a graph G is a function c : V (G) {1, 2,... k}. A proper k coloring of a graph G is a coloring of G with k colors so that no
More informationLecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) January 11, 2018 Lecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1 In this lecture
More informationMATH 350 GRAPH THEORY & COMBINATORICS. Contents
MATH 350 GRAPH THEORY & COMBINATORICS PROF. SERGEY NORIN, FALL 2013 Contents 1. Basic definitions 1 2. Connectivity 2 3. Trees 3 4. Spanning Trees 3 5. Shortest paths 4 6. Eulerian & Hamiltonian cycles
More informationA graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.
2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from
More informationMonotone Paths in Geometric Triangulations
Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation
More informationModule 11. Directed Graphs. Contents
Module 11 Directed Graphs Contents 11.1 Basic concepts......................... 256 Underlying graph of a digraph................ 257 Out-degrees and in-degrees.................. 258 Isomorphism..........................
More informationFundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
More informationarxiv: v1 [cs.ds] 8 Jan 2019
Subset Feedback Vertex Set in Chordal and Split Graphs Geevarghese Philip 1, Varun Rajan 2, Saket Saurabh 3,4, and Prafullkumar Tale 5 arxiv:1901.02209v1 [cs.ds] 8 Jan 2019 1 Chennai Mathematical Institute,
More informationImproved Results on Geometric Hitting Set Problems
Improved Results on Geometric Hitting Set Problems Nabil H. Mustafa nabil@lums.edu.pk Saurabh Ray saurabh@cs.uni-sb.de Abstract We consider the problem of computing minimum geometric hitting sets in which,
More informationPaths, Flowers and Vertex Cover
Paths, Flowers and Vertex Cover Venkatesh Raman, M.S. Ramanujan, and Saket Saurabh Presenting: Hen Sender 1 Introduction 2 Abstract. It is well known that in a bipartite (and more generally in a Konig)
More informationEDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m
EDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m GARY MACGILLIVRAY BEN TREMBLAY Abstract. We consider homomorphisms and vertex colourings of m-edge-coloured graphs that have a switching operation
More informationParameterized graph separation problems
Parameterized graph separation problems Dániel Marx Department of Computer Science and Information Theory, Budapest University of Technology and Economics Budapest, H-1521, Hungary, dmarx@cs.bme.hu Abstract.
More informationarxiv: v5 [cs.dm] 9 May 2016
Tree spanners of bounded degree graphs Ioannis Papoutsakis Kastelli Pediados, Heraklion, Crete, reece, 700 06 October 21, 2018 arxiv:1503.06822v5 [cs.dm] 9 May 2016 Abstract A tree t-spanner of a graph
More informationAdjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge.
1 Graph Basics What is a graph? Graph: a graph G consists of a set of vertices, denoted V (G), a set of edges, denoted E(G), and a relation called incidence so that each edge is incident with either one
More informationLecture 9 - Matrix Multiplication Equivalences and Spectral Graph Theory 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanfordedu) February 6, 2018 Lecture 9 - Matrix Multiplication Equivalences and Spectral Graph Theory 1 In the
More informationFace covers and the genus of apex graphs Bojan Mohar Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia
Face covers and the genus of apex graphs Bojan Mohar Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia bojan.mohar@uni-lj.si Abstract A graph G is an apex graph if it contains
More information