3 Coloring Triangle Free Planar Graphs with a Precolored 8 Cycle
|
|
- Daisy McLaughlin
- 5 years ago
- Views:
Transcription
1 Mathematics Publications Mathematics 0-05 Coloring Triangle Free Planar Graphs with a Precolored 8 Cycle zdeněk dvořák Charles University Bernard Lidicky Iowa State University, lidicky@iastate.edu Follow this and additional works at: Part of the Mathematics Commons The complete bibliographic information for this item can be found at math_pubs/7. For information on how to cite this item, please visit howtocite.html. This Article is brought to you for free and open access by the Mathematics at Iowa State University Digital Repository. It has been accepted for inclusion in Mathematics Publications by an authorized administrator of Iowa State University Digital Repository. For more information, please contact digirep@iastate.edu.
2 Coloring Triangle Free Planar Graphs with a Precolored 8 Cycle Abstract Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize all situations where a -coloring of C does not extend to a proper -coloring of the whole graph. Keywords graph coloring, planar graph Disciplines Mathematics Comments This article is published as Lidický, Bernard. " Coloring Triangle Free Planar Graphs with a Precolored 8 Cycle." Journal of Graph Theory 80, no. (05): 98-. doi: 0.00/jgt.84. Posted with permission. Creative Commons License This work is licensed under a Creative Commons Attribution-No Derivative Works.0 License. This article is available at Iowa State University Digital Repository:
3 -Coloring Triangle-Free Planar Graphs with a Precolored 8-Cycle zdeněk dvořák, and Bernard Lidický, COMPUTER SCIENCE INSTITUTE CHARLES UNIVERSITY IN PRAGUE rakdver@iuuk.mff.cuni.cz DEPARTMENT OF MATHEMATICS IOWA STATE UNIVERSITY RESEARCH PARTIALLY DONE AT UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN lidicky@iastate.edu Received May, 0; Revised August 8, 04 Published online December 04 in Wiley Online Library (wileyonlinelibrary.com). DOI 0.00/jgt.84 Abstract: Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize all situations where a -coloring of C does not extend to a proper -coloring of the whole graph. C 04 Wiley Periodicals, Inc. J. Graph Theory 80: 98, 05 Keywords: graph coloring; planar graph Graphs in this article may have loops or parallel edges. A (proper) k-coloring ofagraph G = (V, E) is a mapping ϕ : V {,...,k} such that ϕ(u) ϕ(v) whenever uv is an edge of G. A graph G is k-colorable if there exists a k-coloring of G. Contract grant sponsor: Center of Excellence Inst. for Theor. Comp. Sci., Prague (project P0//G06 of Czech Science Foundation). NSF; Contract grant number: DMS Journal of Graph Theory C 04 Wiley Periodicals, Inc. 98
4 -COLORING TRIANGLE-FREE PLANAR GRAPHS 99 Deciding whether a graph is k-colorable is NP-complete [7] for every k. The situation is somewhat different for planar graphs, which are 4-colorable by the well-known Four Color Theorem [6, 7, ]. However, -colorability of planar graphs is NP-complete [9], which motivates study of additional assumptions guaranteeing -colorability. For instance, Grötzsch theorem [9] states that every triangle-free planar graph is -colorable, inspiring many related results. Gimbel and Thomassen [8] proved that a triangle-free projective-planar graph is -colorable unless it contains a nonbipartite quadrangulation. We say that a graph G is k-critical if it is not (k )-colorable but every proper subgraph of G is (k )-colorable; thus, the previous result could be restated as the claim that every 4-critical triangle-free projective-planar graph is a nonbipartite quadrangulation. Critical graphs and study of their properties give important tools for both theory and algorithms for graph coloring. For example, many coloring algorithms (especially for embedded graphs) are based on detection of particular critical subgraphs. Let us give a quick overview of results regarding embedded critical graphs. While there are infinitely many 5-critical graphs embeddable in any fixed surface except for the sphere, Thomassen [4] proved that for every g 0andk 6, there are only finitely many k-critical graphs of Euler genus g. This result was later improved by Postle and Thomas [] by showing that such 6-critical graphs have size O(g). For graphs of girth at least five, there are only finitely many k-critical graphs of Euler genus g for every g 0 and k 4, as proved by Thomassen [5]; the bound on the size of such graphs was later improved to O(g) by Dvořák et al. [4]. For triangle-free graphs, there are only finitely many k-critical graphs of Euler genus g for every g 0andk 5. There are infinitely many triangle-free 4-critical graphs of genus g for every g, however their structure is restricted as shown by Dvořák et al. [5]; in particular, one can design a linear-time algorithm to decide -colorability of triangle-free graphs of bounded genus []. A problem that commonly arises in study of critical graphs is as follows. Suppose that F is a k-critical graph andc is a (usually small) subgraph of F whose removal disconnects F. What can one say about the arising components? This motivates the following definition. Let G beagraphandc its (not necessarily induced) proper subgraph. We say that G is C-critical for k-coloring if for every proper subgraph H G such that C H, there exists a k-coloring of C that extends to a k-coloring of H, but not to a k-coloring of G. Notice that (k + )-critical graphs are exactly C-critical graphs for k-coloring with C =. Furthermore, it is easy to see that if F is a (k + )-critical graph and F = G G, where C = G G, then either G = C or G is C-critical for k-coloring. A variation on this claim that is often useful when dealing with embedded graphs is as follows. Lemma Dvořák et al. []. Let G be a plane graph with outer face K. Let C be a cycle in G that does not bound a face, and let H be the subgraph of G drawn in the closed disk bounded by C. If G is K-critical for k-coloring, then H is C-critical for k-coloring. Another way to view C-critical graphs is the precoloring extension perspective. Suppose that we are given a coloring ψ of a proper subgraph C of G, does there exist a coloring of G that matches ψ on C? To answer this question, it suffices to consider the colorings of a maximal C-critical subgraph of G. As suggested by Lemma, an important case of the precoloring extension problem is the one where all precolored vertices are incident with one face of a plane graph (without loss of generality the outer one). From now on, we only deal with -colorings in this Journal of Graph Theory DOI 0.00/jgt
5 00 JOURNAL OF GRAPH THEORY article, and thus we usually omit the qualifier for -coloring when speaking about C-critical graphs. Plane critical graphs of girth 5 with a precolored face of length at most were enumerated by Walls [7] and independently by Thomassen [5], who also gives some necessary conditions for plane graphs of girth 5 with a precolored face of length. The exact enumeration of plane graphs of girth 5 with a precolored face of length appears in Dvořák and Kawarabayashi []. The number of critical graphs grows exponentially with the length of the precolored face, and enumerating all the plane critical graphs becomes increasingly difficult. Dvořák and Lidický [6] implemented an algorithm to generate such plane graphs of girth 5 based on the results of Dvořák and Kawarabayashi [], and used the computer to enumerate the plane critical graphs of girth 5 with the outer face of length at most 6. In this article, we consider the same question in the setting of triangle-free graphs. Aksenov [5] showed that any precoloring of a face of length at most 5 in a plane trianglefree graph extends to the whole graph. Gimbel and Thomassen [8] characterized plane critical graphs of girth 4 with a precolored face of length 6. The faces of a plane graph distinct from the outer one are called internal. Theorem Gimbel and Thomassen [8]. Let G be a plane triangle-free graph with outer face bounded by a cycle C = c c...of length at most 6. The graph G is C-critical if and only if C is a 6-cycle, all internal faces of G have length exactly four and G contains no separating 4-cycles. Furthermore, if ϕ is a -coloring of G[V (C)] that does not extend to a -coloring of G, then ϕ(c ) = ϕ(c 4 ), ϕ(c ) = ϕ(c 5 ) and ϕ(c ) = ϕ(c 6 ). The previous result was independently obtained by Aksenov, Borodin, and Glebov []. Theorem can be also seen as a consequence of work of Aksenov [5] where he showed that a precoloring of a 5-face f in a graph G with one triangle T does not extend only if f and T share an edge and the other faces are 4-faces. The characterization was further extended by Aksenov, Borodin, and Glebov [] to a precolored face of length 7, see Corollary 0 in Section. In this article, we give a simpler proof of this result by exploiting properties of nowhere-zero flows. Furthermore, as the main result, we extend the characterization to the case of a precolored face of length 8. For a plane graph G,letS(G) denote the multiset of lengths of the internal ( 5)-faces of G. Theorem. Let G be a connected plane triangle-free graph with outer face bounded by a cycle C of length 8. The graph G is C-critical if and only if G contains no separating cycles of length at most five, the interior of every non-facial 6-cycle contains only faces of length four and one of the following propositions is satisfied (see Fig. for an illustration). (a) S(G) =,or (b) S(G) ={6} and the 6-face of G intersects C in a path of length at least one, or (c) S(G) ={5, 5} and each of the 5-faces of G intersects C in a path of length at least two, or (d) S(G) ={5, 5} and the vertices of C and the 5-faces f and f of G can be labelled in clockwise order along their boundaries so that C = c c...c 8,f = c v zv v and f = zw c 5 w w (where w can be equal to v,v can be equal to c,etc.) Journal of Graph Theory DOI 0.00/jgt
6 -COLORING TRIANGLE-FREE PLANAR GRAPHS 0 (a) c (b) (c) c c 4 c v v w z v w w c 5 c 8 c 6 c 7 (d) FIGURE. Graph described by Theorem and examples of -colorings of C that do not extend. (d) Apart from extending a coloring of a cycle, it is known that coloring of any two vertices x and y in a triangle-free planar graph G extends to a -coloring of G. Ifx and y have different colors, the result was proved by Aksenov [] and independently by Jensen and Thomassen [0]. If x and y are nonadjacent and have the same color, the result was proved by Aksenov, Borodin, and Glebov [4]. This case actually implies also the previous case; if x and y should have different colors, it is enough to add a new vertex y adjacent only to y and color x and y by the same color. A simpler proof was given by Borodin, Kostochka, Lidický and Yancey [8]. We describe a connection between nowhere-zero flows and -colorings in Section. We follow with Section constraining lengths of faces in critical graphs. Section is devoted to the special case where the precolored face has length k, one other face has length k and the rest are 4-faces. Finally, in Section 4 we give a proof of Theorem.. -COLORINGS AND NOWHERE-ZERO FLOWS Let H be a connected plane graph without loops and let H be the dual of H. Letϕ be a -coloring ϕ of H by colors {,, }. Let us define an orientation of H as follows. Let e E(H) be an edge incident with a vertex u V (H) and let f and h be the faces incident with e, appearing as f, e, h in the clockwise order around u in the drawing of H. Let v be the other vertex of G incident with e and let e be the edge of H corresponding to e. The edge e is oriented toward h if and only if ϕ(u) ϕ(v) {, }. Suppose that h is the outer face of H and h is bounded by a cycle; if e is oriented toward h, thenwe say that e is a sink edge, otherwise e is a source edge. Note that whether an edge is source or sink depends only on the restriction of ϕ to the boundary of the outer face. Journal of Graph Theory DOI 0.00/jgt
7 0 JOURNAL OF GRAPH THEORY s 0-0 t (a) s (b) FIGURE. (a) A -coloring ψ of a graph G with the corresponding orientation of edges of G and the balanced layout q. (b) The corresponding graph G q,ψ.(c)g q,ψ together with G. Since ϕ is a proper coloring, every edge of H has an orientation. As shown by Tutte [6], this orientation of H defines a nowhere-zero Z -flow; that is, for each f V (H ), the in-degree and the out-degree of f differ by a multiple of. Conversely, each nowhere-zero Z -flow in H defines a -coloring of H, uniquely up to a rotation of colors. See e.g. [0] for more details. Consider a face f of H, and let δ(f ) be the difference between its in-degree and out-degree when considered as a vertex of H. Clearly, δ(f ) and f have the same parity and δ(f ) f.sinceδ(f ) is a multiple of, if f is a 4-face, then δ(f ) = 0. Similarly, if f =5or f =7, then δ(f ) =, and if f =6or f =8, then δ(f ) {0, 6}. Let G be a connected plane triangle-free graph with the outer face C bounded by a cycle. We say that a function q assigning an integer to each internal face of G is a layout if each internal face f satisfies q( f ) f, q( f ) is divisible by and has the same parity as f. In particular, q( f ) = 0 for every 4-face, and thus it suffices to specify the values of q for ( 5)-faces of G. Consider a proper -coloring ψ of C, letn s be the number of source edges and n t the number of sink edges of C with respect to ψ and let m be the sum of the values of q over all internal faces of G. We say that q is ψ-balanced if n s + m = n t. We define a graph G q,ψ as follows. The vertex set of G q,ψ consists of the internal faces of G and of two new vertices s and t. The adjacencies between vertices of V (G q,ψ ) \{s, t} are the same as in the dual of G. For each internal face f with q( f )>0, s is joined to f by q( f ) parallel edges. For each internal face f with q( f )<0, t is joined to f by q( f ) parallel edges. For each edge e E(C) incident with an internal face f, f is joined to t if e is a sink edge with respect to ψ, and f is joined to s otherwise. See Figure for an illustration. We say that s and t are the terminals of G q,ψ and we write c(q,ψ) for the degree of s in G q,ψ. Note that q is ψ-balanced if and only if s and t have the same degree. t (c) Journal of Graph Theory DOI 0.00/jgt
8 -COLORING TRIANGLE-FREE PLANAR GRAPHS 0 Lemma 4. Let G be a connected plane triangle-free graph with the outer face C bounded by a cycle and let ψ be a -coloring of C. The coloring ψ extends to a -coloring of G if and only if there exists a ψ-balanced layout q such that the terminals of G q,ψ are not separated by an edge-cut smaller than c(q,ψ). Proof. Suppose first that ψ extends to a -coloring ϕ of G. Let us orient G according to ϕ as described at the beginning of the section. For each internal face f of G, letq( f ) be the difference between the in-degree and the out-degree of f. Clearly, q is a layout. Let s and t be the terminals of G q,ψ, let us orient the edges of G q,ψ incident with s away from s and the edges incident with t toward t, and orient all the other edges of G q,ψ in the same way as in the orientation of G. Note that for each vertex f V (G q,ψ ) \{s, t}, the in-degree of f in G q,ψ is equal to its out-degree. Consequently, s and t have the same degree and the orientation of edges of G q,ψ defines a flow of size c(q,ψ) from s to t. Therefore, every edge-cut between s and t in G q,ψ has capacity at least c(q,ψ). Let us now conversely assume that there exists a ψ-balanced layout q such that the terminals of G q,ψ are not separated by an edge-cut smaller than c(q,ψ). By Menger s theorem, G q,ψ contains c(q,ψ) pairwise-edge disjoint paths P..., P c(q,ψ ) from s to t. Let G = G q,ψ E(P... P c(q,ψ ) ).Sinceq( f ) has the same parity as f for every internal face f of G, each vertex of G has even degree, and thus G is a union of pairwise edge-disjoint cycles. For each such cycle, orient all its edges in one (arbitrary) direction. For each path P i ( i c(q,ψ)), orient its edges toward t. This defines an orientation of G q,ψ, which gives an orientation of G corresponding to a nowhere-zero Z -flow consistent with the coloring ψ. By the correspondence between flows and colorings, this defines a -coloring of G that extends ψ. Let us remark that for plane triangle-free graphs G such that ( f 4) f internal face of G is bounded by a constant c, Lemma 4 can be used to decide in polynomial time whether a given precoloring ψ of the outer face extends to a -coloring of G: try all possible ψ-balanced layouts q for G (whose number is bounded by a function of c) and for each of them, decide whether the terminals of G q,ψ are separated by an edge-cut of size less than c(q,ψ)using a maximum flow algorithm. In order to apply Lemma 4 efficiently, we describe the structure of small edge-cuts separating the terminals in G q,ψ. Lemma 5. Let G be a connected plane triangle-free graph with the outer face C bounded by a cycle and let ψ be a -coloring of C that does not extend to a -coloring ofg.ifqisaψ-balanced layout in G, then there exists a subgraph K 0 G such that either (a) K 0 is a path with both ends in C and no internal vertex in C, and if P is a path in C joining the endvertices of K 0,n s is the number of source edges of P, n t is the number of sink edges of P and m is the sum of the values of q over all faces of G drawn in the open disk bounded by the cycle P + K 0,then n s + m n t > K 0. In particular, P + m > K 0.Or, (b) K 0 is a cycle with at most one vertex in C, and if m is the sum of the values of q over all faces of G drawn in the open disk bounded by K 0,then m > K 0. Journal of Graph Theory DOI 0.00/jgt
9 04 JOURNAL OF GRAPH THEORY n s n t P m K 0 C m K 0 C (a) (b) FIGURE. Possibilites in Lemma 5. See Figure for an illustration. Proof. By Lemma 4, there exists an edge-cut in G q,ψ smaller than c(q,ψ) and separating the terminals. Let us choose such an edge-cut K so that K has as few edges not incident with the terminals as possible, and subject to that K is minimal. Let s and t be the terminals of G q,ψ and let S and T be the sets of edges of G q,ψ incident with s and t, respectively. Let K 0 = K \ (S T ); note that since K < c(q,ψ) and G q,ψ {s, t} is connected, the set K 0 is not empty. Therefore, the minimality of K 0 implies that G q,ψ {s, t} K has at least two components. Consider a connected component A of G q,ψ {s, t} K. LetY be the set of edges of G q,ψ connecting a vertex of A with a vertex of V (G q,ψ ) \ A,letY 0 = Y K 0, Y s = Y S and Y t = Y T.AsG q,ψ {s, t} is connected, the set Y 0 is not empty. By the minimality of K, either Y s is nonempty, Y s K = and Y t K, ory t is nonempty, Y t K = and Y s K. In the former case we say that A is an s-component, in the latter case a t-component. By symmetry, we can assume that A is a t-component. Suppose that Y t Y s + Y 0. By the minimality of K 0, each edge of Y 0 is incident with an s-component, and thus K = (K \ (Y s Y 0 )) Y t is an edge-cut separating s from t of size at most K. Furthermore, since Y 0 is nonempty, K would contradict the assumption that K was chosen with K 0 as small as possible. It follows that ()each t-component satisfies Y t > Y s + Y 0, and each s-component satisfies Y s > Y t + Y 0. Note that K = Y s Y 0 (T \ Y t ) is an edge-cut separating s from t of size Y s + Y 0 + T Y t < T =c(q,ψ). By the minimality of K 0,we have Y 0 = K 0. As this observation applies to every connected component of G q,ψ {s, t} K, we conclude that G q,ψ {s, t} K has exactly two connected components (an s-component and a t-component). We can interpret K 0 as a subgraph of G by duality. Thus, the conclusion of the previous paragraph is equivalent to the claim that the subgraph of G consisting of C and K 0 has exactly two internal faces. It follows that the edges of K 0 form either a path joining two distinct vertices of C, or a cycle intersecting C in at most one vertex. In the former case, let P be a path in C joining the endvertices of C, andletn s, n t, and m be defined as in the statement (a) of the lemma. Let A be the component of G q,ψ {s, t} K whose vertices correspond to the faces of G drawn in the open disk bounded by P + K 0. Note that Y s Y t =n s n t + m.by(),wehave n s n t + m > K 0. In the latter case, G q,ψ {s, t} K has a component A not incident with any edges of C; its vertices correspond to the faces of G drawn in the open disk bounded by K 0. Journal of Graph Theory DOI 0.00/jgt
10 -COLORING TRIANGLE-FREE PLANAR GRAPHS 05 Let Y 0, Y s, and Y t be defined as before, and note that m = Y s Y t.by(),wehave m = Y s Y t > Y 0 = K 0.. FACES IN CRITICAL GRAPHS Note that Lemma 4 is most useful for graphs with almost all faces of length 4, as then there are only a few choices for the layout. Recall that for a plane graph G, we use S(G) to denote the multiset of lengths of the internal ( 5)-faces of G. LetG g,k denote the set of plane graphs of girth at least g and with outer face formed by a cycle C of length k that are C-critical. Let S g,k ={S(G) : G G g,k }. Note that S 5,k is finite for every k by Thomassen [5]. However, we only need to know the sets S 5,k for k 8. Theorem 6 Thomassen []. Let G be a plane graph of girth at least five with outer face bounded by a cycle C of length at most 8. The graph G is C-critical if and only if G is an 8-cycle with a chord. This implies that S 5,k = for k 7andthatS 5,8 ={{5, 5}}.Dvořák et al. [5] proved that S 4,k is finite for every k (actually, the sum of each multiset in S 4,k is bounded by a linear function of k). Furthermore, they proved that {k } belongs to S 4,k and every other element of S 4,k has maximum at most k. Let S and S be multisets of integers. We say that S is a one-step refinement of S if there exist k S and a set Z S 4,k S 4,k+ such that S = (S \{k}) Z. We say that S is a refinement of S if it can be obtained from S by a (possibly empty) sequence of one-step refinements. Lemma 7 Dvořák et al. [5]. For every k 7, each element of S 4,k other than {k } is a refinement of an element of S 4,k S 5,k. In particular, together with Theorems and 6 this implies that S 4,k = for k 5, S 4,6 ={ }, S 4,7 {{5}} and S 4,8 {, {5, 5}, {6}}.. QUADRANGULATIONS AND GRAPHS WITH A (k )-FACE As a first application of Lemma 4, let us consider quadrangulations. Theorem 8. Let G be a connected triangle-free plane graph with outer face bounded by a cycle C of length k 6. Suppose that all internal faces of G have length 4. The graph G is C-critical if and only if G contains no separating 4-cycles. Proof. If G is C-critical, then it does not contain separating 4-cycles by Lemma and Theorem. Suppose now conversely that G does not contain separating 4-cycles. Let G 0 be a proper subgraph of G containing C.SinceG does not contain separating 4-cycles, it follows that G 0 has a face f of length at least 6. Let G G 0 be the subgraph of G consisting of all vertices and edges not drawn in the interior of f.asgis bipartite, it does not contain separating ( 5)-cycles, and thus the dual G of G does not contain an edge-cut of size at most 5 separating C from f. Therefore, there exist six pairwise edge-disjoint paths P..., P 6 from f to C in G. Note that all vertices of G E(P... P 6 ) have even Journal of Graph Theory DOI 0.00/jgt
11 06 JOURNAL OF GRAPH THEORY degree, and thus G E(P... P 6 ) is a union of pairwise edge-disjoint cycles. We orient the edges of each of the cycles in one (arbitrary) direction and direct the edges of P..., P 6 toward C. This orientation of G corresponds to a nowhere-zero Z -flow, giving a -coloring ϕ of G.Letψ be the restriction of ϕ to C, and observe that C contains k/ + sink edges and k/ source edges with respect to this coloring. Note that G has only one layout (assigning 0 to every internal face), and this layout is not ψ-balanced. By Lemma 4, ψ does not extend to a -coloring of G. On the other hand, ψ extends to a -coloring of G 0,sinceG 0 is a subgraph of G. We conclude that for every proper subgraph of G containing C, there exists a precoloring of C that extends to this subgraph but not to G, and thus G is C-critical. Next, we deal with the graphs with an internal face of length k. Let r(k) = 0if k 0 (mod ), r(k) = ifk (mod ), and r(k) = ifk (mod ). Theorem 9. Let G be a connected triangle-free plane graph with outer face bounded by a cycle C of length k 7. Suppose that f is an internal face of G of length k and that all other internal faces of G have length 4. The graph G is C-critical if and only if (a) f C is a path of length at least r(k) (possibly empty if r(k) = 0), (b) G contains no separating 4-cycles, and (c) for every ( k )-cycle K f in G, the interior of K does not contain f. Furthermore, in a graph satisfying these conditions, a precoloring ψ of C extends to a -coloring of G if and only if E(C) \ E( f ) contains both a source edge and a sink edge with respect to ψ. Proof. If G is C-critical, then it does not contain separating 4-cycles by Lemma and Theorem. Furthermore, by Lemma 7, if m k, then no element of S 4,m contains k, and thus Lemma implies that if G is C-critical, then it satisfies (c). Assume from now on that G satisfies (b) and (c). Suppose that ψ is a -coloring of C that does not extend to a -coloring of G. Letd be the difference between the number of sink and source edges of C with respect to ψ. If d > k, then since k and d have the same parity, it follows that d =k. Inthis case k 0 (mod ) and r(k) = 0, and thus (a) is trivially true. Furthermore, either all edges of C are source or all of them are sink. If d k, then let q be the layout for G such that q( f ) = d. Note that q is ψ- balanced. Let K 0 be the subgraph of G obtained by Lemma 5. As G satisfies (c), K 0 is not a cycle. Therefore, K 0 is a path joining two distinct vertices of C. LetP be the subpath of C joining the endvertices of K 0 such that the open disk bounded by P + K 0 does not contain f,letn s be the number of source edges in P and n t the number of sink edges in P. By Lemma 5, we have P > K 0.LetR be the path C P and consider the cycle Z = R + K 0. Note that Z =k + K 0 P < k. By (c), we conclude that Z is the boundary of f.as f =k, it follows that K 0 = P, and since n s + n t = P and n s n t > K 0, it follows that n s = 0orn t = 0, i.e., either all edges of E(C) \ E( f ) are source or all of them are sink. Let m s be the number of source edges of C and m t the number of sink edges of C.Note that m t m s = d 0 (mod ), and thus m s + m t m s m t (mod ). It follows that m s m t r(k) (mod ). SinceR = f C contains either all source edges or all sink edges of C, it follows that f C is a path of length at least r(k). Journal of Graph Theory DOI 0.00/jgt
12 -COLORING TRIANGLE-FREE PLANAR GRAPHS 07 (a) (b) (c) FIGURE 4. Critical graphs with a precolored 7-face. Therefore, if G is C-critical, then it satisfies (a). Furthermore, if G is a graph satisfying (b) and (c), then every precoloring of C such that E(C) \ E( f ) contains both a source edge and a sink edge extends to a -coloring of G. Suppose now that G satisfies (a), (b), and (c). Let ψ be a -coloring of C such that alledgesofe(c) \ E( f ) are source (such a coloring exists by (a)). Let q be the unique ψ-balanced layout for G and let K consist of E( f ) \ E(C) and of all edges of G q,ψ joining f with s. Note that E(C) \ E( f ) = E( f ) \ E(C) +, and thus K is an edgecut separating the terminals in G q,ψ of size c(q,ψ). By Lemma 4, ψ does not extend to a -coloring of G. It follows that G contains a C-critical subgraph G 0. By (c), G 0 has an internal face of length at least k. By Lemma 7, the only element of S 4,k whose maximum is at least k is{k }, and thus all other internal faces of G 0 have length four. By (b), it follows that G = G 0, and thus G is C-critical. Since S 4,7 {{5}}, Theorem 9 fully characterizes plane triangle-free graphs critical with respect to a precolored 7-face. The following corollary additionally discusses the three possible cases of the intersection of the 5-face with the 7-face in such a graph. Corollary 0. Let G be a plane triangle-free graph with outer face bounded by a cycle C = c...c 7 of length 7. The graph G is C-critical and ψ is a -coloring of C that does not extend to a -coloring of G if and only if G contains no separating cycles of length at most five and one of the following propositions is satisfied up to relabelling of vertices (see Fig. 4 for an illustration). (a) The graph G consists of C and the edge c c 5, and ψ(c ) = ψ(c 5 ). (b) The graph G contains a vertex v adjacent to c and c 4, the cycle c c c c 4 v bounds a 5-face and every face drawn inside the 6-cycle vc 4 c 5 c 6 c 7 c has length four; furthermore, ψ(c 4 ) = ψ(c 7 ) and ψ(c 5 ) = ψ(c ). (c) The graph G contains a path c uvc with u, v V (C), the cycle c c c vu bounds a 5-face and every face drawn inside the 8-cycle uvc c 4 c 5 c 6 c 7 c has length four; furthermore, ψ(c ) = ψ(c 6 ), ψ(c ) = ψ(c 4 ) = ψ(c 7 ) and ψ(c ) = ψ(c 5 ). 4. GRAPHS WITH PRECOLORED 8-FACE Finally, we consider the plane triangle-free graphs critical with respect to a precolored face of length 8. Journal of Graph Theory DOI 0.00/jgt
13 08 JOURNAL OF GRAPH THEORY Proof of Theorem. Suppose that G is C-critical. By Lemma and Theorem, G does not contain any separating cycles of length at most five and the interior of every nonfacial 6-cycle contains only faces of length four. By Lemma 7, we have S(G) = or S(G) ={6} or S(G) ={5, 5}.IfS(G) =,thengsatisfies (a). If S(G) ={6},thenG satisfies (b) by Theorem 9. Therefore, suppose that S(G) ={5, 5}, andlet f and f be the 5-faces of G. Let ψ be a -coloring of C by colors {,, } that does not extend to a -coloring of G. By symmetry, we can assume that C contains at least as many source edges as sink ones. It follows that C contains either four or seven source edges. If C has seven source edges, then let q be the layout for G such that q( f ) = q( f ) =. Note that q is ψ-balanced, and consider the subgraph K 0 of G obtained by Lemma 5. As q( f ) + q( f ) =6and neither f nor f are contained inside a separating ( 6)-cycle, it follows that K 0 is a path joining two distinct vertices of C. LetP be a subpath of C joining the endpoints of K 0 such that the open disk bounded by P + K 0 contains at most one of f and f.letn s be the number of source edges in P and n t the number of sink edges in P. If does not contain any 5-face, then P > K 0 by Lemma 5. Since all faces in have length 4, it follows that P + K 0 is even, and thus P K 0 +. If contains a 5-face (say f ), then since C has seven source edges, we can by symmetry between f and f assume that n s 4, and thus P n s n t = n s n t + q( f ) > K 0 by Lemma 5. In both cases, we have P K 0 +. Let R = C P and note that R + K 0 is a cycle of length at most C P + K 0 C = 6. However, by the choice of P, the open disk bounded by R + K 0 contains a 5-face, contrary to the assumptions of Theorem. Therefore, C has four source edges, and G has two ψ-balanced layouts q and q such that q i ( f i ) = andq i ( f i ) = fori {, }. LetK and K be the subgraphs of G obtained by Lemma 5 applied to q and q, respectively. As q i ( f j ) =and q i ( f ) + q i ( f ) = 0fori, j {, }, the case (b) of Lemma 5 cannot apply, and thus both K and K are paths. Let v and w be the endpoints of K and let v and w be the endpoints of K. Suppose that there exists a path P C joining v i with w i for some i {, } such that all faces drawn in the open disk bounded by P + K i have length 4. By Lemma 5, we have P > K i, and since P + K i has even length, P K i +. We conclude that the cycle (C P) + K i has length at most C P + K i 6, and since the open disk bounded by (C P) + K i contains two 5-faces, it contradicts the assumptions of Theorem. Consequently, there is no such path. For i {, }, letp i C be the path joining v i with w i such that the open disk i bounded by P i + K i contains f i.letn s i and nt i denote the number of source and sink edges, respectively, of P i,fori {, }. By Lemma 5, we have n s i nt i + > K i.sincen t i 4and K i, we have n s i nt i + =ns i nt i +, and thus n s i nt i + K i.as i contains one five face and all other faces in i have length 4, the cycle K i + P i has odd length, and thus P i and K i have opposite parity. Since P i and n s i nt i have the same parity, we can improve the inequality to () ns i nt i + K i. Suppose first that we can choose the labels so that the order of the endpoints along C is v, w, v, w (this is always the case if the endpoints of K and K are not pairwise distinct). Let ψ be the -coloring of C defined by ψ (x) = 4 ψ(x). The source edges with respect to ψ are sink edges with respect to ψ and vice versa. Consequently, replacing ψ with ψ swaps the roles of the paths K and K. Therefore, by making this replacement if necessary, we can assume that P and P are edge-disjoint, as in Figure 5(a). For i {, },thecyclek i + P i has length at least five, i.e., () n s i + nt i + K i 5. Summing this inequality with (), we obtain n s i. However, since P and P are edge-disjoint Journal of Graph Theory DOI 0.00/jgt
14 -COLORING TRIANGLE-FREE PLANAR GRAPHS 09 w v v β s β t w n t n s P f K K f n t n s P α s α t f Q α z Q β Q γ Q δ f γ s γ t v w v δ s δ t w (a) FIGURE 5. Possible cuts in G. (b) and C has exactly four source edges, we have n s + ns 4. We conclude that ns i = for i {, } and that equality holds in () and (). In particular, K i + P i is a 5-cycle, and since G does not contain separating 5-cycles, it follows that K i + P i = f i. Therefore, f i C = P i is a path of length at least n s i =, and G satisfies (c). Finally, consider the case that the endpoints of K and K are pairwise distinct and their order along C is v, v, w, w.letα, β, γ, and δ be the subpaths of C between v and v, between v and w, between w and w, and between w and v, respectively, chosen so that the paths α, β, γ and δ are pairwise edge-disjoint. By planarity, the paths K and K intersect. Let Q α denote the walk between v and v such that the concatenation of α with Q α is the boundary walk of the internal face of the graph C + K + K incident with α. Letα s and α t denote the number of source and sink edges of α, respectively. Define Q x, x s, and x t for x {β,γ,δ} analogously. By symmetry, we can assume that f is contained in the open disk bounded by α + Q α and f is contained in the closed disk bounded by γ + Q γ, as in Figure 5(b). Note that P = α + β and P = β + γ, and thus by (), we have α s + β s α t β t + K and β s + γ s β t γ t + K. Furthermore, α + Q α and γ + Q γ have length at least 5, and Q α + Q γ K + K, implying that α s + α t + γ s + γ t + K + K 0. Summing these inequalities, we obtain α s + β s + γ s β t 4. As α s + β s + γ s + δ s = 4, this implies that β t δ s,andasβ t and δ s are non-negative, we have β t = δ s = 0. Furthermore, all the inequalities must hold with equality, and in particular α + Q α and γ + Q γ have length 5. As G does not contain separating 5-cycles, we have f = α + Q α and f = γ + Q γ. Also, Q α + Q γ = K + K, and thus every edge of K K is incident with f or f. We conclude that the boundaries of f and f intersect; let z be an arbitrary common vertex of f and f. Since β t = 0 = δ s = 0, all edges of β are source and all edges of δ are sink. Let c be the vertex of α at distance α s from v,andc 5 the vertex of γ at distance γ s from w. Note that the distance between c and c 5 in C is α s + β s + γ s = 4 δ s = 4, and thus we can label the vertices of C as c c...c 8 in order. Let W be the path between c and z in α K,letZ be the path between c and z in α K,letW be the path between c 5 and z in γ K, and let Z be the path between c 5 and z in γ K.Note that W + Z = f and W + Z = f, and thus W + Z =5and W + Z =5. As α s + β s α t β t + = K and α s + β s + γ s = 4, we have α t + K +γ s = 5 β t = 5, i.e., W + Z =5. Symmetrically, Z + W =5. It follows that W = W and Z = Z. As the disk bounded by the closed walk W + W + c c c c 4 c 5 contains 5-faces f and f,wehave W + W +4 > 6. Consequently, W >, and symmetrically Z >. By symmetry, we can assume that W = W =and Z = Z =, and we conclude that G satisfies (d). Journal of Graph Theory DOI 0.00/jgt
15 0 JOURNAL OF GRAPH THEORY Suppose now that G is a graph satisfying (a), (b), (c) or (d). If G satisfies (a), then it is C-critical by Theorem 8. If G satisfies (b), then it is C-critical by Theorem 9. Let us consider the case that G satisfies (c) or (d). If G satisfies (c), then let ψ be a -coloring of C with exactly four source edges, two of them incident with f and two of them incident with f.ifg satisfies (d), then let ψ be a -coloring of C with exactly four source edges c c, c c, c c 4, and c 4 c 5. Note that q and q are the only ψ-balanced layouts for G. Observe that both G q,ψ and G q,ψ contain an edge-cut of size at most 5 separating the terminals, while c(q,ψ)= c(q,ψ)= 7. By Lemma 4, ψ does not extend to a -coloring of G, and thus G has a C-critical subgraph G 0. By Lemma 7, we have S(G 0 ) {, {6}, {5, 5}}. AsG does not contain separating ( 5)-cycles and the interior of every 6-cycle of G contains only 4-faces, we conclude that G = G 0, and thus G is C-critical. ACKNOWLEDGMENTS We thank Alexandr Kostochka for encouraging us to write this article. REFERENCES [] V. A. Aksenov, Chromatic connected vertices in planar graphs, Diskret Analiz (977), 5 6 (in Russian). [] V. A. Aksenov, O.V. Borodin and A. N. Glebov, Continuation of a -coloring from a 6-face onto a plane graph without -cycles, Diskretn Anal Issled Oper Ser 0 (00), (in Russian). [] V. A. Aksenov, O. V. Borodin and A. N. Glebov, Extending -colorability from a 7-face to a planar triangle-free graph, Sib Elektron Mat Izv (004), 7 8 (in Russian). [4] V. A. Aksenov, O. V. Borodin and N. A. Glebov, On the continuation of a -coloring from two vertices in a plane graph without -cycles, Diskretn Anal Issled Oper Ser 9 (00), 6 (in Russian). [5] V. A. Aksionov, On continuation of -colouring of planar graphs, Diskret Anal Novosibirsk 6 (974), 9 (in Russian). [6] K. Appel and W. Haken, Every planar map is four colorable, Part I: discharging, Illinois J Math (977), [7] K. Appel, W. Haken and J. Koch, Every planar map is four colorable, Part II: reducibility, Illinois J Math (977), [8] O. Borodin, A. Kostochka, B. Lidický and M. Yancey, Short proofs of coloring theorems on planar graphs, Eur J Combin 6 (04), 4. [9] D. Dailey, Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete, Discrete Math 0 (980), [0] R. Diestel, Graph Theory, vol. 7 of Graduate Texts in Mathematics, rd edn., Springer-Verlag, Heidelberg, 005. [] Z. Dvořák and K. Kawarabayashi, Choosability of planar graphs of girth 5, ArXiv (0). Journal of Graph Theory DOI 0.00/jgt
16 -COLORING TRIANGLE-FREE PLANAR GRAPHS [] Z. Dvořák, D. Král, and R. Thomas, Coloring triangle-free graphs on surfaces, In Proceedings of the 0th Annual ACM-SIAM Symposium on Discrete Algorithms (Philadelphia, PA, USA, 009), SODA 09, Society for Industrial and Applied Mathematics, pp [] Z. Dvořák, D. Král and R. Thomas, Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle, ArXiv e-prints (Mar. 0). [4] Z. Dvořák, D. Král and R. Thomas, Three-coloring triangle-free graphs on surfaces III. Graphs of girth five, ArXiv e-prints (Feb. 04). [5] Z. Dvořák, D. Král and R. Thomas, Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs, ArXiv e-prints (Apr. 04). [6] Z. Dvořák and B. Lidický, 4-critical graphs on surfaces without contractible ( 4)-cycles, SIAM J. Discrete Math. 8 (04), no., [7] M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, WH Freeman & Co. New York, NY, USA, 979. [8] J. Gimbel and C. Thomassen, Coloring graphs with fixed genus and girth, Trans Amer Math Soc 49 (997), [9] H. Grötzsch, Ein Dreifarbensatz für Dreikreisfreie Netze auf der Kugel, Math- Natur Reihe 8 (959), [0] T. Jensen and C. Thomassen, The color space of a graph, J Graph Theory 4 (000), [] L. Postle and R. Thomas, A Linear Upper Bound for 6-Critical Graphs on Surfaces, Manuscript [] N. Robertson, D. P. Sanders, P. Seymour and R. Thomas, The four colour theorem, J Combin Theory, Ser B 70 (997), 44. [] C. Thomassen, Grötzsch s -color theorem and its counterparts for the torus and the projective plane, J Combin Theory, Ser B 6 (994), [4] C. Thomassen Color-critical graphs on a fixed surface, J Combin Theory, Ser B 70 (997), [5] C. Thomassen, The chromatic number of a graph of girth 5 on a fixed surface, J Combin Theory, Ser B 87 (00), 8 7. [6] W. Tutte, A contribution on the theory of chromatic polynomials, Canad J Math 6 (954), [7] B. Walls, Coloring girth restricted graphs on surfaces, PhD thesis, Georgia Institute of Technology, 999. Journal of Graph Theory DOI 0.00/jgt
3-coloring triangle-free planar graphs with a precolored 8-cycle
-coloring triangle-free planar graphs with a precolored 8-cycle Zdeněk Dvořák Bernard Lidický May 0, 0 Abstract Let G be a planar triangle-free graph and led C be a cycle in G of length at most 8. We characterize
More informationFine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles
Mathematics Publications Mathematics 2017 Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles Zdeněk Dvořák Charles University Bernard Lidicky
More informationFine structure of 4-critical triangle-free graphs III. General surfaces
Mathematics Publications Mathematics 2018 Fine structure of 4-critical triangle-free graphs III. General surfaces Zdenek Dvorak Charles University, Prague Bernard Lidicky Iowa State University, lidicky@iastate.edu
More informationFine structure of 4-critical triangle-free graphs III. General surfaces
Fine structure of 4-critical triangle-free graphs III. General surfaces Zdeněk Dvořák Bernard Lidický February 16, 2017 Abstract Dvořák, Král and Thomas [4, 6] gave a description of the structure of triangle-free
More informationThree-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle
Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle Zdeněk Dvořák Daniel Král Robin Thomas 11 October 2010 Abstract Let G be a plane graph with with exactly
More informationSUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS
SUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS Arash Asadi Luke Postle 1 Robin Thomas 2 School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT
More informationPlanar 4-critical graphs with four triangles
Planar 4-critical graphs with four triangles Oleg V. Borodin Zdeněk Dvořák Alexandr V. Kostochka Bernard Lidický Matthew Yancey arxiv:1306.1477v1 [math.co] 6 Jun 2013 March 1, 2018 Abstract By the Grünbaum-Aksenov
More informationA simplified discharging proof of Grötzsch theorem
A simplified discharging proof of Grötzsch theorem Zdeněk Dvořák November 29, 2013 Abstract In this note, we combine ideas of several previous proofs in order to obtain a quite short proof of Grötzsch
More informationThree-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies Zdeněk Dvořák Daniel Král Robin Thomas Abstract We settle a problem of Havel by showing that there exists
More informationThree-coloring triangle-free graphs on surfaces III. Graphs of girth five
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five Zdeněk Dvořák Daniel Král Robin Thomas Abstract We show that the size of a 4-critical graph of girth at least five is bounded by
More informationThree-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs Zdeněk Dvořák Daniel Král Robin Thomas Abstract Let G be a 4-critical graph with t triangles, embedded in a
More informationThree-coloring triangle-free planar graphs in linear time
Three-coloring triangle-free planar graphs in linear time Zdeněk Dvořák Ken-ichi Kawarabayashi Robin Thomas 1 April 2009 Abstract Grötzsch s theorem states that every triangle-free planar graph is 3-colorable,
More informationThree-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations Zdeněk Dvořák Daniel Král Robin Thomas Abstract We give a linear-time algorithm to decide 3-colorability (and find
More information3-choosability of triangle-free planar graphs with constraints on 4-cycles
3-choosability of triangle-free planar graphs with constraints on 4-cycles Zdeněk Dvořák Bernard Lidický Riste Škrekovski Abstract A graph is k-choosable if it can be colored whenever every vertex has
More information3-choosability of triangle-free planar graphs with constraint on 4-cycles
3-choosability of triangle-free planar graphs with constraint on 4-cycles Zdeněk Dvořák Bernard Lidický Riste Škrekovski Abstract A graph is k-choosable if it can be colored whenever every vertex has a
More information3-CHOOSABILITY OF TRIANGLE-FREE PLANAR GRAPHS WITH CONSTRAINT ON 4-CYCLES
University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 19, 1000 Ljubljana, Slovenia Preprint series, Vol. 47 (2009), 1080 3-CHOOSABILITY OF TRIANGLE-FREE
More informationThree-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm Zdeněk Dvořák Daniel Král Robin Thomas Abstract We give a linear-time algorithm to decide 3-colorability of a trianglefree graph
More informationFIVE-LIST-COLORING GRAPHS ON SURFACES I. TWO LISTS OF SIZE TWO IN PLANAR GRAPHS
FIVE-LIST-COLORING GRAPHS ON SURFACES I. TWO LISTS OF SIZE TWO IN PLANAR GRAPHS Luke Postle 1 Department of Mathematics and Computer Science Emory University Atlanta, Georgia 30323, USA and Robin Thomas
More information5-list-coloring planar graphs with distant precolored vertices
arxiv:1209.0366v2 [math.co] 3 Feb 2016 5-list-coloring planar graphs with distant precolored vertices Zdeněk Dvořák Bernard Lidický Bojan Mohar Luke Postle Abstract We answer positively the question of
More information5-list-coloring planar graphs with distant precolored vertices
5-list-coloring planar graphs with distant precolored vertices Zdeněk Dvořák Bernard Lidický Bojan Mohar Luke Postle Abstract We prove the conjecture of Albertson stating that every planar graph can be
More informationDirac s Map-Color Theorem for Choosability
Dirac s Map-Color Theorem for Choosability T. Böhme B. Mohar Technical University of Ilmenau, University of Ljubljana, D-98684 Ilmenau, Germany Jadranska 19, 1111 Ljubljana, Slovenia M. Stiebitz Technical
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationSergey Norin Department of Mathematics and Statistics McGill University Montreal, Quebec H3A 2K6, Canada. and
NON-PLANAR EXTENSIONS OF SUBDIVISIONS OF PLANAR GRAPHS Sergey Norin Department of Mathematics and Statistics McGill University Montreal, Quebec H3A 2K6, Canada and Robin Thomas 1 School of Mathematics
More informationFractional coloring of triangle-free planar graphs
Fractional coloring of triangle-free planar graphs Zdeněk Dvořák, Jean-Sébastien Sereni, Jan Volec To cite this version: Zdeněk Dvořák, Jean-Sébastien Sereni, Jan Volec. Fractional coloring of triangle-free
More informationFIVE-LIST-COLORING GRAPHS ON SURFACES II. A LINEAR BOUND FOR CRITICAL GRAPHS IN A DISK
FIVE-LIST-COLORING GRAPHS ON SURFACES II. A LINEAR BOUND FOR CRITICAL GRAPHS IN A DISK Luke Postle 1 Department of Combinatorics and Optimization University of Waterloo Waterloo, ON Canada N2L 3G1 and
More informationGIRTH SIX CUBIC GRAPHS HAVE PETERSEN MINORS
GIRTH SIX CUBIC GRAPHS HAVE PETERSEN MINORS Neil Robertson 1 Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA P. D. Seymour Bellcore 445 South St. Morristown,
More informationarxiv: v1 [math.co] 11 Apr 2018
Every planar graph without adjacent cycles of length at most 8 is 3-choosable arxiv:1804.03976v1 [math.co] 11 Apr 2018 Runrun Liu and Xiangwen Li Department of Mathematics & Statistics Central China Normal
More informationOn DP-coloring of graphs and multigraphs
On DP-coloring of graphs and multigraphs Anton Bernshteyn Alexandr Kostochka Sergei Pron arxiv:1609.00763v1 [math.co] 2 Sep 2016 Abstract While solving a question on list coloring of planar graphs, Dvořák
More informationCycles in 4-Connected Planar Graphs
Cycles in 4-Connected Planar Graphs Guantao Chen Department of Mathematics & Statistics Georgia State University Atlanta, GA 30303 matgcc@panther.gsu.edu Genghua Fan Institute of Systems Science Chinese
More information4-critical graphs on surfaces without contractible cycles of length at most 4
4-critical graphs on surfaces without contractile cycles of length at most 4 Zdeněk Dvořák, Bernard Lidický Charles University in Prague University of Illinois at Urana-Champaign MIdwest GrapH TheorY LIII
More informationDiscrete Mathematics
Discrete Mathematics 09 (2009) 49 502 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc 2-distance ( + 2)-coloring of planar graphs with girth
More informationA shorter proof of Thomassen s theorem on Tutte paths in plane graphs
A shorter proof of Thomassen s theorem on Tutte paths in plane graphs Kenta Ozeki National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan and JST, ERATO, Kawarabayashi
More informationEXCLUDING MINORS IN NONPLANAR GRAPHS OFGIRTHATLEASTFIVE. Robin Thomas 1 and. Jan McDonald Thomson 2
EXCLUDING MINORS IN NONPLANAR GRAPHS OFGIRTHATLEASTFIVE Robin Thomas 1 thomas@math.gatech.edu and Jan McDonald Thomson 2 thomson@math.gatech.edu School of Mathematics Georgia Institute of Technology Atlanta,
More informationK 4 -free graphs with no odd holes
K 4 -free graphs with no odd holes Maria Chudnovsky 1 Columbia University, New York NY 10027 Neil Robertson 2 Ohio State University, Columbus, Ohio 43210 Paul Seymour 3 Princeton University, Princeton
More informationOn colorability of graphs with forbidden minors along paths and circuits
On colorability of graphs with forbidden minors along paths and circuits Elad Horev horevel@cs.bgu.ac.il Department of Computer Science Ben-Gurion University of the Negev Beer-Sheva 84105, Israel Abstract.
More informationMINIMALLY NON-PFAFFIAN GRAPHS
MINIMALLY NON-PFAFFIAN GRAPHS SERGUEI NORINE AND ROBIN THOMAS Abstract. We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-pfaffian graphs minimal with respect
More informationTriangle-free graphs of tree-width t are (t + 3)/2 -colorable
arxiv:1706.00337v2 [math.co] 9 Jun 2017 Triangle-free graphs of tree-width t are (t + 3)/2 -colorable Zdeněk Dvořák Ken-ichi Kawarabayashi Abstract We prove that every triangle-free graph of tree-width
More informationInduced subgraphs of graphs with large chromatic number. I. Odd holes
Induced subgraphs of graphs with large chromatic number. I. Odd holes Alex Scott Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK Paul Seymour 1 Princeton University, Princeton, NJ 08544,
More informationTHE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1
THE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1 Robin Thomas and Youngho Yoo School of Mathematics Georgia Institute of Technology Atlanta, Georgia 0-0160, USA We prove two results:
More informationPRECISE UPPER BOUND FOR THE STRONG EDGE CHROMATIC NUMBER OF SPARSE PLANAR GRAPHS
Discussiones Mathematicae Graph Theory 33 (2013) 759 770 doi:10.7151/dmgt.1708 PRECISE UPPER BOUND FOR THE STRONG EDGE CHROMATIC NUMBER OF SPARSE PLANAR GRAPHS Oleg V. Borodin 1 Institute of Mathematics
More informationTree-width and planar minors
Tree-width and planar minors Alexander Leaf and Paul Seymour 1 Princeton University, Princeton, NJ 08544 May 22, 2012; revised March 18, 2014 1 Supported by ONR grant N00014-10-1-0680 and NSF grant DMS-0901075.
More informationSteinberg s Conjecture
Steinberg s Conjecture Florian Hermanns September 5, 2013 Abstract Every planar graph without 4-cycles and 5-cycles is 3-colorable. This is Steinberg s conjecture, proposed in 1976 by Richard Steinberg.
More informationarxiv: v1 [math.co] 25 Dec 2017
Planar graphs without -cycles adjacent to triangles are DP--colorable Seog-Jin Kim and Xiaowei Yu arxiv:1712.08999v1 [math.co] 25 Dec 2017 December 27, 2017 Abstract DP-coloring (also known as correspondence
More informationFractional coloring and the odd Hadwiger s conjecture
European Journal of Combinatorics 29 (2008) 411 417 www.elsevier.com/locate/ejc Fractional coloring and the odd Hadwiger s conjecture Ken-ichi Kawarabayashi a, Bruce Reed b a National Institute of Informatics,
More informationPlanar Graphs (1) Planar Graphs (3) Planar Graphs (2) Planar Graphs (4)
S-72.2420/T-79.5203 Planarity; Edges and Cycles 1 Planar Graphs (1) Topological graph theory, broadly conceived, is the study of graph layouts. Contemporary applications include circuit layouts on silicon
More informationDecomposing planar cubic graphs
Decomposing planar cubic graphs Arthur Hoffmann-Ostenhof Tomáš Kaiser Kenta Ozeki Abstract The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree,
More informationDecomposing plane cubic graphs
Decomposing plane cubic graphs Kenta Ozeki and Dong Ye Abstract It was conjectured by Hoffmann-Ostenhof that the edge set of every cubic graph can be decomposed into a spanning tree, a matching and a family
More informationSpanning Paths in Infinite Planar Graphs
Spanning Paths in Infinite Planar Graphs Nathaniel Dean AT&T, ROOM 2C-415 600 MOUNTAIN AVENUE MURRAY HILL, NEW JERSEY 07974-0636, USA Robin Thomas* Xingxing Yu SCHOOL OF MATHEMATICS GEORGIA INSTITUTE OF
More informationAn approximate version of Hadwiger s conjecture for claw-free graphs
An approximate version of Hadwiger s conjecture for claw-free graphs Maria Chudnovsky Columbia University, New York, NY 10027, USA and Alexandra Ovetsky Fradkin Princeton University, Princeton, NJ 08544,
More informationNowhere-zero 3-flows in triangularly connected graphs
Nowhere-zero 3-flows in triangularly connected graphs Genghua Fan 1, Hongjian Lai 2, Rui Xu 3, Cun-Quan Zhang 2, Chuixiang Zhou 4 1 Center for Discrete Mathematics Fuzhou University Fuzhou, Fujian 350002,
More informationarxiv: v2 [math.co] 10 May 2016
The asymptotic behavior of the correspondence chromatic number arxiv:602.00347v2 [math.co] 0 May 206 Anton Bernshteyn University of Illinois at Urbana-Champaign Abstract Alon [] proved that for any graph
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationDP-4-COLORABILITY OF PLANAR GRAPHS WITHOUT GIVEN TWO ADJACENT CYCLES
DP-4-COLORABILITY OF PLANAR GRAPHS WITHOUT GIVEN TWO ADJACENT CYCLES RUNRUN LIU 1 AND XIANGWEN LI 1 AND KITTIKORN NAKPRASIT 2 AND PONGPAT SITTITRAI 2 AND GEXIN YU 1,3 1 School of Mathematics & Statistics,
More informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More information{2, 2}-Extendability of Planar Graphs
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 6, Issue 6 (March 2013), PP. 61-66 {2, 2}-Extendability of Planar Graphs Dharmaiah
More informationNowhere-zero flows in signed series-parallel graphs arxiv: v1 [math.co] 6 Nov 2014
Nowhere-zero flows in signed series-parallel graphs arxiv:1411.1788v1 [math.co] 6 Nov 2014 Tomáš Kaiser 1,2 Edita Rollová 1,3 Abstract Bouchet conjectured in 1983 that each signed graph that admits a nowhere-zero
More informationarxiv: v1 [math.co] 22 Jan 2018
arxiv:1801.07025v1 [math.co] 22 Jan 2018 Spanning trees without adjacent vertices of degree 2 Kasper Szabo Lyngsie, Martin Merker Abstract Albertson, Berman, Hutchinson, and Thomassen showed in 1990 that
More informationUNIQUENESS OF HIGHLY REPRESENTATIVE SURFACE EMBEDDINGS
UNIQUENESS OF HIGHLY REPRESENTATIVE SURFACE EMBEDDINGS P. D. Seymour Bellcore 445 South St. Morristown, New Jersey 07960, USA and Robin Thomas 1 School of Mathematics Georgia Institute of Technology Atlanta,
More informationHomomorphism Bounded Classes of Graphs
Homomorphism Bounded Classes of Graphs Timothy Marshall a Reza Nasraser b Jaroslav Nešetřil a Email: nesetril@kam.ms.mff.cuni.cz a: Department of Applied Mathematics and Institute for Theoretical Computer
More informationList-coloring the Square of a Subcubic Graph
List-coloring the Square of a Subcubic Graph Daniel W. Cranston University of Illinois Urbana-Champaign, USA Seog-Jin Kim Konkuk University Seoul, Korea February 1, 2007 Abstract The square G 2 of a graph
More informationFractional and circular 1-defective colorings of outerplanar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 6() (05), Pages Fractional and circular -defective colorings of outerplanar graphs Zuzana Farkasová Roman Soták Institute of Mathematics Faculty of Science,
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H 1, H 2 ) so that H 1 H 2 = G E(H 1 ) E(H 2 ) = V (H 1 ) V (H 2 ) = k Such a separation is proper if V (H
More informationColoring the Square of Planar Graphs Without 4-Cycles or 5-Cycles
Virginia Commonwealth University VCU Scholars Compass Theses and Dissertations Graduate School 205 Coloring the Square of Planar Graphs Without 4-Cycles or 5-Cycles Robert Jaeger Virginia Commonwealth
More informationTriangle-free graphs with no six-vertex induced path
Triangle-free graphs with no six-vertex induced path Maria Chudnovsky 1, Paul Seymour 2, Sophie Spirkl Princeton University, Princeton, NJ 08544 Mingxian Zhong Columbia University, New York, NY 10027 June
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
More informationEdge-face colouring of plane graphs with maximum degree nine
Edge-face colouring of plane graphs with maximum degree nine Jean-Sébastien Sereni Matěj Stehlík Abstract An edge-face colouring of a plane graph with edge set E and face set F is a colouring of the elements
More informationOn Perfect Matching Coverings and Even Subgraph Coverings
On Perfect Matching Coverings and Even Subgraph Coverings Xinmin Hou, Hong-Jian Lai, 2 and Cun-Quan Zhang 2 SCHOOL OF MATHEMATICAL SCIENCES UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA HEFEI, ANHUI, 20026
More informationarxiv: v1 [math.co] 28 Oct 2016
More on foxes arxiv:1610.09093v1 [math.co] 8 Oct 016 Matthias Kriesell Abstract Jens M. Schmidt An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting
More informationThe Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
More informationGUOLI DING AND STAN DZIOBIAK. 1. Introduction
-CONNECTED GRAPHS OF PATH-WIDTH AT MOST THREE GUOLI DING AND STAN DZIOBIAK Abstract. It is known that the list of excluded minors for the minor-closed class of graphs of path-width numbers in the millions.
More informationGraphs of Degree 4 are 5-Edge-Choosable
Graphs of Degree 4 are 5-Edge-Choosable Martin Juvan, Bojan Mohar and Riste Škrekovski DEPARTMENT OF MATHEMATICS UNIVERSITY OF LJUBLJANA JADRANSKA 19, 1111 LJUBLJANA SLOVENIA Received June 11, 1996; revised
More informationarxiv: v1 [math.co] 7 Nov 2018
DP-4-COLORABILITY OF TWO CLASSES OF PLANAR GRAPHS LILY CHEN 1 AND RUNRUN LIU 2 AND GEXIN YU 2, AND REN ZHAO 1 AND XIANGQIAN ZHOU 1,4 arxiv:1811.02920v1 [math.co] Nov 2018 1 School of Mathematical Sciences,
More informationarxiv: v2 [math.co] 6 Sep 2016
Acyclic chromatic index of triangle-free -planar graphs Jijuan Chen Tao Wang Huiqin Zhang Institute of Applied Mathematics Henan University, Kaifeng, 475004, P. R. China arxiv:504.06234v2 [math.co] 6 Sep
More informationPaths and cycles in extended and decomposable digraphs
Paths and cycles in extended and decomposable digraphs Jørgen Bang-Jensen Gregory Gutin Department of Mathematics and Computer Science Odense University, Denmark Abstract We consider digraphs called extended
More informationOn the Turán number of forests
On the Turán number of forests Bernard Lidický Hong Liu Cory Palmer April 13, 01 Abstract The Turán number of a graph H, ex(n, H, is the maximum number of edges in a graph on n vertices which does not
More informationClaw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version.
Claw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version. Part II. Nontrivial strip-structures Maria Chudnovsky Department of Industrial Engineering and Operations Research Columbia
More informationA Sufficient condition for DP-4-colorability
A Sufficient condition for DP-4-colorability Seog-Jin Kim and Kenta Ozeki August 21, 2017 Abstract DP-coloring of a simple graph is a generalization of list coloring, and also a generalization of signed
More informationPerfect matchings in highly cyclically connected regular graphs
Perfect matchings in highly cyclically connected regular graphs arxiv:1709.08891v1 [math.co] 6 Sep 017 Robert Lukot ka Comenius University, Bratislava lukotka@dcs.fmph.uniba.sk Edita Rollová University
More informationMINIMALLY NON-PFAFFIAN GRAPHS
MINIMALLY NON-PFAFFIAN GRAPHS SERGUEI NORINE AND ROBIN THOMAS Abstract. We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-pfaffian graphs minimal with respect
More informationDisjoint paths in unions of tournaments
Disjoint paths in unions of tournaments Maria Chudnovsky 1 Princeton University, Princeton, NJ 08544, USA Alex Scott Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK Paul Seymour 2 Princeton
More informationEdge-colouring seven-regular planar graphs
Edge-colouring seven-regular planar graphs Maria Chudnovsky 1 Columbia University, New York, NY 10027 Katherine Edwards 2 Princeton University, Princeton, NJ 08544 Ken-ichi Kawarabayashi 3 National Institute
More informationarxiv: v1 [math.co] 17 Jul 2017
Bad News for Chordal Partitions Alex Scott Paul Seymour David R. Wood Abstract. Reed and Seymour [1998] asked whether every graph has a partition into induced connected non-empty bipartite subgraphs such
More informationInjective colorings of sparse graphs
Injective colorings of sparse graphs Daniel W. Cranston Seog-Jin Kim Gexin Yu August 28, 2008 Abstract Let Mad(G) denote the maximum average degree (over all subgraphs) of G and let χ i(g) denote the injective
More informationTriangle-free graphs that do not contain an induced subdivision of K 4 are 3-colorable
Triangle-free graphs that do not contain an induced subdivision of K 4 are 3-colorable Maria Chudnovsky Princeton University, Princeton, NJ 08544 Chun-Hung Liu Princeton University, Princeton, NJ 08544
More informationRecognizing Berge Graphs
Carnegie Mellon University Research Showcase @ CMU Tepper School of Business 5-20-2004 Recognizing Berge Graphs Maria Chudnovsky Princeton University Gérard Cornuéjols Carnegie Mellon University, gc0v@andrew.cmu.edu
More informationNested Cycles in Large Triangulations and Crossing-Critical Graphs
Nested Cycles in Large Triangulations and Crossing-Critical Graphs César Hernández Vélez 1, Gelasio Salazar,1, and Robin Thomas,2 1 Instituto de Física, Universidad Autónoma de San Luis Potosí. San Luis
More informationEven Pairs and Prism Corners in Square-Free Berge Graphs
Even Pairs and Prism Corners in Square-Free Berge Graphs Maria Chudnovsky Princeton University, Princeton, NJ 08544 Frédéric Maffray CNRS, Laboratoire G-SCOP, University of Grenoble-Alpes, France Paul
More informationAn upper bound on the domination number of n-vertex connected cubic graphs
Discrete Mathematics 309 (2009) 1142 1162 www.elsevier.com/locate/disc An upper bound on the domination number of n-vertex connected cubic graphs A.V. Kostochka a,b,, B.Y. Stodolsky a a Department of Mathematics,
More informationDiscrete Mathematics. The average degree of a multigraph critical with respect to edge or total choosability
Discrete Mathematics 310 (010 1167 1171 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The average degree of a multigraph critical with respect
More informationarxiv: v2 [math.co] 26 Jan 2017
A better bound on the largest induced forests in triangle-free planar graphs Hung Le arxiv:1611.04546v2 [math.co] 26 Jan 2017 Oregon State University Abstract It is well-known that there eists a triangle-free
More informationCombined degree and connectivity conditions for H-linked graphs
Combined degree and connectivity conditions for H-linked graphs FLORIAN PFENDER Universität Rostock Institut für Mathematik D-18055 Rostock, Germany Florian.Pfender@uni-rostock.de Abstract For a given
More informationNear-colorings and Steinberg conjecture
Near-colorings and Steinberg conjecture André Raspaud LaBRI Université Bordeaux I France Department of Mathematics, Zhejiang Normal University, Jinhua, China October 3, 20 Proper k-coloring Proper k-coloring
More informationInjective colorings of sparse graphs
Injective colorings of sparse graphs Daniel W. Cranston Seog-Jin Kim Gexin Yu June 10, 2010 Abstract Let mad(g) denote the maximum average degree (over all subgraphs) of G and let χ i(g) denote the injective
More informationCographs; chordal graphs and tree decompositions
Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs
More informationCombinatorics and Optimization 442/642, Fall 2012
Compact course notes Combinatorics and Optimization 44/64, Fall 0 Graph Theory Contents Professor: J. Geelen transcribed by: J. Lazovskis University of Waterloo December 6, 0 0. Foundations..............................................
More informationarxiv: v1 [math.co] 13 May 2016
GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in
More informationGenerating p-extremal graphs
Generating p-extremal graphs Derrick Stolee Department of Mathematics Department of Computer Science University of Nebraska Lincoln s-dstolee1@math.unl.edu August 2, 2011 Abstract Let f(n, p be the maximum
More informationThe edge-density for K 2,t minors
The edge-density for K,t minors Maria Chudnovsky 1 Columbia University, New York, NY 1007 Bruce Reed McGill University, Montreal, QC Paul Seymour Princeton University, Princeton, NJ 08544 December 5 007;
More informationA Separator Theorem for Graphs with an Excluded Minor and its Applications
A Separator Theorem for Graphs with an Excluded Minor and its Applications Noga Alon IBM Almaden Research Center, San Jose, CA 95120,USA and Sackler Faculty of Exact Sciences, Tel Aviv University, Tel
More information