Cographs; chordal graphs and tree decompositions
|
|
- Noreen Ellis
- 6 years ago
- Views:
Transcription
1 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 is defined recursively as follows. The graph with one vertex is a cograph. The disjoint union of two cographs is a cograph. The complement of a cograph is a cograph. A graph is a cograph if and only if it can be obtained by a finite number of applications of these rules. For example, K 4 is a cograph, because its complement is a union of single-vertex graphs. Theorem 1. Forb (P 4 ) = cographs. Proof. Firstly, note that the class of cographs is induced-subgraph-closed. Furthermore, P 4 is not a cograph, since it has more than one vertex and both P 4 and its complement are connected. Hence, if a graph G contains P 4 as an induced subgraph, then G is not a cograph, and thus Forb (P 4 ) cographs. Therefore, we only need to prove that every graph G such that P 4 G is a cograph. We prove the claim by induction, and thus we assume that the claim holds for all graphs with less than V (G) vertices. Since all graphs with at most 3 vertices are cographs, we can assume that V (G) 4. If G is not connected, then by induction hypothesis, all the components of G are cographs, and thus G is a cograph. Hence, assume that G is connected. 1
2 Consider any vertex v V (G), and let G = G v. Note that P 4 G, and by the induction hypothesis, G is a cograph. Suppose first that G is not connected, and let C 1,..., C n be the components of G. Since G is connected, v has a neighbor u i V (C i ) for 1 i n. If v is adjacent to all vertices of G, then G = G {v} is a cograph. Hence, we can assume that a vertex w 1 V (C 1 ) is not adjacent to v. Since C 1 is connected, we can assume that u 1 is adjacent to w 1. However, then w 1 u 1 vv 2 is an induced path in G, which contradicts the assumption that P 4 G. Finally, consider the case that G is connected. Since G is a cograph with more than one vertex, its complement is not connected. Furthermore, P 4 = P 4, and thus P 4 G. By the same argument as in the previous paragraph, we prove that G is a cograph, and thus G is a cograph. A graph G is chordal if no cycle of length greater than 3 is induced, that is, chordal = Forb (holes). There are several related characterization of chordal graphs. For a connected graph G, S V (G) is a minimal cut if G S is not connected, but G S is connected for every S S. Observe that every vertex of a minimal cut S has a neighbor in every component of G S. Lemma 2. If a connected graph G is chordal, then every minimal cut S V (G) induces a clique. Proof. Suppose that u, v S are not adjacent. Let C 1 and C 2 be components of G S. Since S is a minimal cut, both u and v have neighbors both in C 1 and in C 2. For i {1, 2}, let P i be a shortest path between u and v through C i. Then P 1 P 2 is an induced hole in G, which contradicts the assumption that G is chordal. Theorem 3. If G is chordal and not a clique, then there exist G 1, G 2 G such that G = G 1 G 2 and G 1 G 2 is a clique. Proof. If G is not connected, we can take G 1 to be a component of G and G 2 = G\V (G 2 ). Hence, assume that G is connected. Since G is not a clique, there exist vertices x, y V (G) that are not adjacent. Let S 0 = V (G)\{x, y}. Then G S 0 is not connected. Consequently, there exists S S 0 such that S is a minimal cut. Let G S = C 1 C 2, where C 1 and C 2 are non-empty and disjoint. Then we can set G 1 = G V (C 2 ) and G 2 = G V (C 1 ). Note that G 1 G 2 = G[S] is a clique by Lemma 2. Observe also that if G 1 and G 2 are chordal and G 1 G 2 is a clique, then G 1 G 2 is chordal. Hence, every chordal graph can be obtained using a finite number of applications of these rules: 2
3 A complete graph is chordal. If G 1 and G 2 are chordal and G is obtained from G 1 and G 2 by gluing on a clique, then G is chordal. A vertex v V (G) is simplicial if the neighborhood of v in G induces a clique. Lemma 4. If G is chordal and not a clique, then G contains two nonadjacent simplicial vertices. Proof. We prove the claim by induction, and thus we assume that it holds for all graphs with less than V (G) vertices. By Theorem 3, there exist G 1, G 2 G such that G = G 1 G 2 and G 1 G 2 is a clique. For i {1, 2}, if G i is not a clique, then by the induction hypothesis, G i contains two nonadjacent simplicial vertices, and at most one of them belongs to the clique G 1 G 2. Let v i be a simplicial vertex of G i not belonging to G 1 G 2. If G i is a clique, then let v i be any vertex of G i not belonging to G 1 G 2. Since neither v 1 nor v 2 belong to G 1 G 2, observe that v 1 and v 2 are non-adjacent simplicial vertices of G. Theorem 5. A graph G is chordal if and only if every induced subgraph of G contains a simplicial vertex. Proof. Every induced subgraph of a chordal graph is chordal, and contains a simplicial vertex by Lemma 4. Hence, it suffices to prove that if every induced subgraph of G contains a simplicial vertex, then G is chordal. We prove the claim by induction on the number of vertices of G, and thus we assume that the claim holds for all graphs with less than V (G) vertices. Let v be a simplicial vertex of G. By the induction hypothesis, G v is chordal, and thus every induced hole in G contains v. However, for any hole C = uvwz 1 z 2... G, the vertices u and w are adjacent, and thus C is not induced. It follows that G is chordal. A tree decomposition of a graph G is a pair (T, β), where β : V (T ) 2 V (G) assigns a bag β(n) to each vertex of T, such that for every v V (G), there exists n V (T ) such that v β(n) every vertex is in some bag, for every uv E(G), there exists n V (T ) such that u, v β(n) every edge is in some bag, and 3
4 for every v V (G), the set {n V (T ) : v β(n)} induces a connected subtree of T every vertex appears in a connected subtree of the decomposition. The width of the tree decomposition is the size of the largest bag minus one. Example: a tree decomposition of C 12 of width 4. v 5 v 4 v 3 v 2 v 1 v 1 v 2 v 3 v 4 v 5 v 6 v 1 v 3 v 4 v 6 v 12 v 6 v 12 v 6 v 7 v 9 v 10 v 12 v 7 v 8 v 9 v 10 v 11 v 7 v 8 v 9 v 10 v 11 v 12 A tree decomposition (T, β) is reduced if every n 1 n 2 β(n 1 ) β(n 2 ) and β(n 2 ) β(n 1 ). E(T ) satisfies Lemma 6. For every tree decomposition (T, β) of G, there exists a reduced tree decomposition (T, β ) of G such that each bag of (T, β ) is equal to some bag of (T, β). Proof. Suppose that n 1 n 2 E(T ) satisfies β(n 1 ) β(n 2 ). Let T 1 be the tree obtained from T by contracting the edge n 1 n 2, and let n V (T 1 ) be the vertex obtained from n 1 and n 2 by this contraction. Let β 1 : V (T 1 ) 2 V (G) be defined by β 1 (n) = β(n 2 ) and β 1 (n ) = β(n ) for every n V (T 1 ) \ {n}. Then (T 1, β 1 ) is a tree decomposition of G with fewer vertices. By repeating this operation as long as possible, we eventually obtain a reduced tree decomposition of G. Corollary 7. If G has a tree decomposition of width at most k, then the minimum degree of G is at most k. Proof. Let (T, β) be a reduced tree decomposition of G of width at most k, and let n be a leaf of T. Since (T, β) is reduced, there exists v V (G) such that v only appears in the bag of n. Hence, all neighbors of v belong to β(n), and thus deg(v) β(n) 1 k. Lemma 8. If G is a complete graph, then G has only one reduced tree decomposition: tree with one vertex with bag equal to V (G). 4
5 Proof. Let (T, β) be a reduced tree decomposition of G, and suppose that T has an edge n 1 n 2. Since (T, β) is reduced, there exists x β(n 1 ) \ β(n 2 ) and y β(n 2 ) \ β(n 1 ). Let T x be the subtree of T induced by the vertices whose bags contain x, and let T y be the subtree of T induced by the vertices whose bags contain y. Since n 1 V (T x ) and n 2 V (T y ), the edge n 1 n 2 belongs neither to T x nor to T y. Hence, T x and T y are subgraphs of different components of T n 1 n 2, and thus they are disjoint. However, xy E(G) implies that some bag contains both x and y, which is a contradiction. Therefore, a reduced tree decomposition of G has no edges. Corollary 9. If S V (G) induces a clique in G and (T, β) is a tree decomposition of G, then there exists n V (T ) such that S β(n). Proof. Let β 1 : V (T ) 2 S be defined by β 1 (n) = β(n) S for every n V (T ). Then (T, β 1 ) is a tree decomposition of the clique G[S]. By Lemma 6, there exists a reduced tree decomposition (T 2, β 2 ) of G[S] whose every bag is equal to some bag of (T, β 1 ). By Lemma 8, T 2 has only one vertex n 2, and β 2 (n 2 ) = S. Let n be a vertex of T such that β 2 (n 2 ) = β 1 (n). We have S = β 2 (n 2 ) = β 1 (n) β(n). Theorem 10. A graph G is chordal if and only if it has a tree decomposition (T, β) such that every bag induces a clique. Proof. Suppose that G is chordal. We proceed by induction, and thus we can assume that the claim holds for all graphs with less than V (G) vertices. If G is a clique, then we can set V (T ) = {n} and β(n) = V (G). Hence, assume that G is not a clique, and by Theorem 3, there exist G 1, G 2 G such that G = G 1 G 2 and G 1 G 2 is a clique. For i {1, 2}, the induction hypothesis implies that there exists a tree decomposition (T i, β i ) of G i such that every bag induces a clique. By Corollary 9, there exists n i V (T i ) such that V (G 1 G 2 ) β i (n i ). Let T be the tree obtained from T 1 and T 2 by adding the edge n 1 n 2. Let β be defined by β(n) = β 1 (n) if n V (T 1 ) and β(n) = β 2 (n) if n V (T 2 ). Then (T, β) is a tree decomposition of G such that every bag induces a clique. Conversely, suppose that G has a tree decomposition (T, β) such that every bag induces a clique. Consider a cycle C G, and let β : V (T ) 2 V (C) be defined by β (n) = β(n) V (C) for every n V (T ). Then, (T, β ) is a tree decomposition of C such that every bag induces a clique. By Corollary 7, any tree decomposition of a cycle must contain a bag of size at least three, and thus C contains a clique of size three. Therefore, C is a triangle. It follows that G contains no induced hole, and thus G is chordal. 5
6 2 Exercises 1. ( ) Let C be the class of graphs that can be obtained by a finite number of applications of these rules: The graph with one vertex belongs to C. For any G 1, G 2 C, the disjoint union of G 1 and G 2 belongs to C. For any G 1, G 2 C, the complete join of G 1 and G 2 (the graph obtained from the disjoint union of G 1 and G 2 by adding all edges with one end in G 1 and the other end in G 2 ) belongs to C. Prove that C is exactly the class of all cographs. 2. ( ) A graph G is a split graph if its vertex set can be partitioned to an independent set and a clique (with arbitrary edges between the two parts), i.e., there exist disjoint A, B V (G) such that A B = V (G), G[A] is an independent set and G[B] is a clique. Prove that Forb (C 4, C 5, 2K 2 ) = split graphs. Hint: first show that all graphs in Forb (C 4, C 5, 2K 2 ) are chordal. 3. ( ) Let (T, β) be a tree decomposition of G. Let n 1, n 2 and n 3 be vertices of T such that n 2 lies on the path between n 1 and n 3 in T. Prove that every path in G from β(n 1 ) to β(n 3 ) intersects β(n 2 ). 6
Tree-width. September 14, 2015
Tree-width Zdeněk Dvořák September 14, 2015 A tree decomposition of a graph G is a pair (T, β), where β : V (T ) 2 V (G) assigns a bag β(n) to each vertex of T, such that for every v V (G), there exists
More informationTree-width and algorithms
Tree-width and algorithms Zdeněk Dvořák September 14, 2015 1 Algorithmic applications of tree-width Many problems that are hard in general become easy on trees. For example, consider the problem of finding
More informationCLIQUES IN THE UNION OF GRAPHS
CLIQUES IN THE UNION OF GRAPHS RON AHARONI, ELI BERGER, MARIA CHUDNOVSKY, AND JUBA ZIANI Abstract. Let B and R be two simple graphs with vertex set V, and let G(B, R) be the simple graph with vertex set
More informationProbe interval graphs and probe unit interval graphs on superclasses of cographs
Author manuscript, published in "" Discrete Mathematics and Theoretical Computer Science DMTCS vol. 15:2, 2013, 177 194 Probe interval graphs and probe unit interval graphs on superclasses of cographs
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 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 informationStrongly chordal and chordal bipartite graphs are sandwich monotone
Strongly chordal and chordal bipartite graphs are sandwich monotone Pinar Heggernes Federico Mancini Charis Papadopoulos R. Sritharan Abstract A graph class is sandwich monotone if, for every pair of its
More informationExtremal Graphs Having No Stable Cutsets
Extremal Graphs Having No Stable Cutsets Van Bang Le Institut für Informatik Universität Rostock Rostock, Germany le@informatik.uni-rostock.de Florian Pfender Department of Mathematics and Statistics University
More 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 informationDynamic Programming on Trees. Example: Independent Set on T = (V, E) rooted at r V.
Dynamic Programming on Trees Example: Independent Set on T = (V, E) rooted at r V. For v V let T v denote the subtree rooted at v. Let f + (v) be the size of a maximum independent set for T v that contains
More informationDefinitions Results. Polar cographs 1 IMA-ROSE. Ecole Polytechnique Fédérale de Lausanne, Switzerland
Polar cographs Tınaz Ekim 1 N.V.R. Mahadev 2 Dominique de Werra 1 1 IMA-ROSE Ecole Polytechnique Fédérale de Lausanne, Switzerland tinaz.ekim@epfl.ch, dewerra.ima@epfl.ch 2 Fitchburg State College, USA
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 informationHW Graph Theory SOLUTIONS (hbovik) - Q
1, Diestel 3.5: Deduce the k = 2 case of Menger s theorem (3.3.1) from Proposition 3.1.1. Let G be 2-connected, and let A and B be 2-sets. We handle some special cases (thus later in the induction if these
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 informationPartial characterizations of clique-perfect graphs I: subclasses of claw-free graphs
Partial characterizations of clique-perfect graphs I: subclasses of claw-free graphs Flavia Bonomo a,1, Maria Chudnovsky b,2 and Guillermo Durán c,3 a Departamento de Computación, Facultad de Ciencias
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
More informationEnumerating minimal connected dominating sets in graphs of bounded chordality,
Enumerating minimal connected dominating sets in graphs of bounded chordality, Petr A. Golovach a,, Pinar Heggernes a, Dieter Kratsch b a Department of Informatics, University of Bergen, N-5020 Bergen,
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 informationTrees. A tree is a graph which is. (a) Connected and. (b) has no cycles (acyclic).
Trees A tree is a graph which is (a) Connected and (b) has no cycles (acyclic). 1 Lemma 1 Let the components of G be C 1, C 2,..., C r, Suppose e = (u, v) / E, u C i, v C j. (a) i = j ω(g + e) = ω(g).
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 informationFixed Parameter Algorithms for Interval Vertex Deletion and Interval Completion Problems
Fixed Parameter Algorithms for Interval Vertex Deletion and Interval Completion Problems Arash Rafiey Department of Informatics, University of Bergen, Norway arash.rafiey@ii.uib.no Abstract We consider
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationarxiv: v1 [cs.ds] 2 Oct 2018
Contracting to a Longest Path in H-Free Graphs Walter Kern 1 and Daniël Paulusma 2 1 Department of Applied Mathematics, University of Twente, The Netherlands w.kern@twente.nl 2 Department of Computer Science,
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 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 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 informationRing Sums, Bridges and Fundamental Sets
1 Ring Sums Definition 1 Given two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) we define the ring sum G 1 G 2 = (V 1 V 2, (E 1 E 2 ) (E 1 E 2 )) with isolated points dropped. So an edge is in G 1 G
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 informationDecompositions of graphs into cycles with chords
Decompositions of graphs into cycles with chords Paul Balister Hao Li Richard Schelp May 22, 2017 In memory of Dick Schelp, who passed away shortly after the submission of this paper Abstract We show that
More informationA characterization of diameter-2-critical graphs with no antihole of length four
Cent. Eur. J. Math. 10(3) 2012 1125-1132 DOI: 10.2478/s11533-012-0022-x Central European Journal of Mathematics A characterization of diameter-2-critical graphs with no antihole of length four Research
More 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 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 information4-coloring P 6 -free graphs with no induced 5-cycles
4-coloring P 6 -free graphs with no induced 5-cycles Maria Chudnovsky Department of Mathematics, Princeton University 68 Washington Rd, Princeton NJ 08544, USA mchudnov@math.princeton.edu Peter Maceli,
More informationProperties of θ-super positive graphs
Properties of θ-super positive graphs Cheng Yeaw Ku Department of Mathematics, National University of Singapore, Singapore 117543 matkcy@nus.edu.sg Kok Bin Wong Institute of Mathematical Sciences, University
More informationChordal Graphs, Interval Graphs, and wqo
Chordal Graphs, Interval Graphs, and wqo Guoli Ding DEPARTMENT OF MATHEMATICS LOUISIANA STATE UNIVERSITY BATON ROUGE, LA 70803-4918 E-mail: ding@math.lsu.edu Received July 29, 1997 Abstract: Let be the
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 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 informationPartial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs
Partial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs Flavia Bonomo a,1, Maria Chudnovsky b,2 and Guillermo Durán c,3 a Departamento de Matemática, Facultad
More informationNotes on Graph Theory
Notes on Graph Theory Maris Ozols June 8, 2010 Contents 0.1 Berge s Lemma............................................ 2 0.2 König s Theorem........................................... 3 0.3 Hall s Theorem............................................
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph Hisayuki HARA and Akimichi TAKEMURA METR 2006 41 July 2006 DEPARTMENT
More informationGraphs with few total dominating sets
Graphs with few total dominating sets Marcin Krzywkowski marcin.krzywkowski@gmail.com Stephan Wagner swagner@sun.ac.za Abstract We give a lower bound for the number of total dominating sets of a graph
More informationToughness and prism-hamiltonicity of P 4 -free graphs
Toughness and prism-hamiltonicity of P 4 -free graphs M. N. Ellingham Pouria Salehi Nowbandegani Songling Shan Department of Mathematics, 1326 Stevenson Center, Vanderbilt University, Nashville, TN 37240
More informationGraph Classes and Ramsey Numbers
Graph Classes and Ramsey Numbers Rémy Belmonte, Pinar Heggernes, Pim van t Hof, Arash Rafiey, and Reza Saei Department of Informatics, University of Bergen, Norway Abstract. For a graph class G and any
More informationHamiltonian problem on claw-free and almost distance-hereditary graphs
Discrete Mathematics 308 (2008) 6558 6563 www.elsevier.com/locate/disc Note Hamiltonian problem on claw-free and almost distance-hereditary graphs Jinfeng Feng, Yubao Guo Lehrstuhl C für Mathematik, RWTH
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 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 informationGraph Minor Theory. Sergey Norin. March 13, Abstract Lecture notes for the topics course on Graph Minor theory. Winter 2017.
Graph Minor Theory Sergey Norin March 13, 2017 Abstract Lecture notes for the topics course on Graph Minor theory. Winter 2017. Contents 1 Background 2 1.1 Minors.......................................
More informationCopyright 2013 Springer Science+Business Media New York
Meeks, K., and Scott, A. (2014) Spanning trees and the complexity of floodfilling games. Theory of Computing Systems, 54 (4). pp. 731-753. ISSN 1432-4350 Copyright 2013 Springer Science+Business Media
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 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 informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationClaw-free Graphs. III. Sparse decomposition
Claw-free Graphs. III. Sparse decomposition Maria Chudnovsky 1 and Paul Seymour Princeton University, Princeton NJ 08544 October 14, 003; revised May 8, 004 1 This research was conducted while the author
More informationThe structure of bull-free graphs II elementary trigraphs
The structure of bull-free graphs II elementary trigraphs Maria Chudnovsky Columbia University, New York, NY 10027 USA May 6, 2006; revised April 25, 2011 Abstract The bull is a graph consisting of a triangle
More information4 Packing T-joins and T-cuts
4 Packing T-joins and T-cuts Introduction Graft: A graft consists of a connected graph G = (V, E) with a distinguished subset T V where T is even. T-cut: A T -cut of G is an edge-cut C which separates
More informationThe path of order 5 is called the W-graph. Let (X, Y ) be a bipartition of the W-graph with X = 3. Vertices in X are called big vertices, and vertices
The Modular Chromatic Number of Trees Jia-Lin Wang, Jie-Ying Yuan Abstract:The concept of modular coloring and modular chromatic number was proposed by F. Okamoto, E. Salehi and P. Zhang in 2010. They
More informationTechnische Universität Ilmenau Institut für Mathematik
Technische Universität Ilmenau Institut für Mathematik Preprint No. M 09/35 Null-homotopic graphs and triangle-completions of spanning trees Rautenbach, Dieter; Schäfer, Philipp Matthias 2009 Impressum:
More informationUNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS
UNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS MARIA CHUDNOVSKY, RINGI KIM, SANG-IL OUM, AND PAUL SEYMOUR Abstract. An n-vertex graph is prime if it has no homogeneous set, that
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 informationDiscrete Mathematics
Discrete Mathematics 310 (2010) 3398 303 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Maximal cliques in {P 2 P 3, C }-free graphs S.A.
More informationThis is a repository copy of Chromatic index of graphs with no cycle with a unique chord.
This is a repository copy of Chromatic index of graphs with no cycle with a unique chord. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/74348/ Article: Machado, RCS, de
More informationFinite Induced Graph Ramsey Theory: On Partitions of Subgraphs
inite Induced Graph Ramsey Theory: On Partitions of Subgraphs David S. Gunderson and Vojtěch Rödl Emory University, Atlanta GA 30322. Norbert W. Sauer University of Calgary, Calgary, Alberta, Canada T2N
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 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 informationarxiv: v1 [cs.dm] 26 Apr 2010
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs George B. Mertzios Derek G. Corneil arxiv:1004.4560v1 [cs.dm] 26 Apr 2010 Abstract Given a graph G, the longest path
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationOn improving matchings in trees, via bounded-length augmentations 1
On improving matchings in trees, via bounded-length augmentations 1 Julien Bensmail a, Valentin Garnero a, Nicolas Nisse a a Université Côte d Azur, CNRS, Inria, I3S, France Abstract Due to a classical
More informationInduced Subgraph Isomorphism on proper interval and bipartite permutation graphs
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs Pinar Heggernes Pim van t Hof Daniel Meister Yngve Villanger Abstract Given two graphs G and H as input, the Induced Subgraph
More informationClique numbers of graph unions
Clique numbers of graph unions Maria Chudnovsky and Juba Ziani Columbia University, New York NY 1007 July 16, 013 Abstract Let B and R be two simple graphs with vertex set V, and let G(B, R) be the simple
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 informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More information1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).
1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting
More informationOn Powers of some Intersection Graphs
On Powers of some Intersection Graphs Geir Agnarsson Abstract We first consider m-trapezoid graphs and circular m-trapezoid graphs and give new constructive proofs that both these classes are closed under
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 informationCounting independent sets of a fixed size in graphs with a given minimum degree
Counting independent sets of a fixed size in graphs with a given minimum degree John Engbers David Galvin April 4, 01 Abstract Galvin showed that for all fixed δ and sufficiently large n, the n-vertex
More informationInduced subgraphs of graphs with large chromatic number. VIII. Long odd holes
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes Maria Chudnovsky 1 Princeton University, Princeton, NJ 08544, USA Alex Scott Mathematical Institute, University of Oxford,
More informationInduced Saturation of Graphs
Induced Saturation of Graphs Maria Axenovich a and Mónika Csikós a a Institute of Algebra and Geometry, Karlsruhe Institute of Technology, Englerstraße 2, 76128 Karlsruhe, Germany Abstract A graph G is
More informationA short course on matching theory, ECNU Shanghai, July 2011.
A short course on matching theory, ECNU Shanghai, July 2011. Sergey Norin LECTURE 3 Tight cuts, bricks and braces. 3.1. Outline of Lecture Ear decomposition of bipartite graphs. Tight cut decomposition.
More information2-bondage in graphs. Marcin Krzywkowski*
International Journal of Computer Mathematics Vol. 00, No. 00, January 2012, 1 8 2-bondage in graphs Marcin Krzywkowski* e-mail: marcin.krzywkowski@gmail.com Department of Algorithms and System Modelling
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 informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationTHE COMPLEXITY OF DISSOCIATION SET PROBLEMS IN GRAPHS. 1. Introduction
THE COMPLEXITY OF DISSOCIATION SET PROBLEMS IN GRAPHS YURY ORLOVICH, ALEXANDRE DOLGUI, GERD FINKE, VALERY GORDON, FRANK WERNER Abstract. A subset of vertices in a graph is called a dissociation set if
More informationTree-chromatic number
Tree-chromatic number Paul Seymour 1 Princeton University, Princeton, NJ 08544 November 2, 2014; revised June 25, 2015 1 Supported by ONR grant N00014-10-1-0680 and NSF grant DMS-1265563. Abstract Let
More informationk-degenerate Graphs Allan Bickle Date Western Michigan University
k-degenerate Graphs Western Michigan University Date Basics Denition The k-core of a graph G is the maximal induced subgraph H G such that δ (H) k. The core number of a vertex, C (v), is the largest value
More informationCharacterizing binary matroids with no P 9 -minor
1 2 Characterizing binary matroids with no P 9 -minor Guoli Ding 1 and Haidong Wu 2 1. Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana, USA Email: ding@math.lsu.edu 2. Department
More informationCATERPILLAR TOLERANCE REPRESENTATIONS OF CYCLES
CATERPILLAR TOLERANCE REPRESENTATIONS OF CYCLES NANCY EATON AND GLENN FAUBERT Abstract. A caterpillar, H, is a tree containing a path, P, such that every vertex of H is either in P or adjacent to P. Given
More informationON THE CORE OF A GRAPHf
ON THE CORE OF A GRAPHf By FRANK HARARY and MICHAEL D. PLUMMER [Received 8 October 1965] 1. Introduction Let G be a graph. A set of points M is said to cover all the lines of G if every line of G has at
More informationGLOBAL MINUS DOMINATION IN GRAPHS. Communicated by Manouchehr Zaker. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 35-44. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir GLOBAL MINUS DOMINATION IN
More informationInduced Cycles of Fixed Length
Induced Cycles of Fixed Length Terry McKee Wright State University Dayton, Ohio USA terry.mckee@wright.edu Cycles in Graphs Vanderbilt University 31 May 2012 Overview 1. Investigating the fine structure
More informationBichain graphs: geometric model and universal graphs
Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United
More informationThe minimum G c cut problem
The minimum G c cut problem Abstract In this paper we define and study the G c -cut problem. Given a complete undirected graph G = (V ; E) with V = n, edge weighted by w(v i, v j ) 0 and an undirected
More informationBerge Trigraphs. Maria Chudnovsky 1 Princeton University, Princeton NJ March 15, 2004; revised December 2, Research Fellow.
Berge Trigraphs Maria Chudnovsky 1 Princeton University, Princeton NJ 08544 March 15, 2004; revised December 2, 2005 1 This research was partially conducted during the period the author served as a Clay
More 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 informationCYCLE STRUCTURES IN GRAPHS. Angela K. Harris. A thesis submitted to the. University of Colorado Denver. in partial fulfillment
CYCLE STRUCTURES IN GRAPHS by Angela K. Harris Master of Science, University of South Alabama, 003 A thesis submitted to the University of Colorado Denver in partial fulfillment of the requirements for
More informationINDUCED CYCLES AND CHROMATIC NUMBER
INDUCED CYCLES AND CHROMATIC NUMBER A.D. SCOTT DEPARTMENT OF MATHEMATICS UNIVERSITY COLLEGE, GOWER STREET, LONDON WC1E 6BT Abstract. We prove that, for any pair of integers k, l 1, there exists an integer
More informationPerfect divisibility and 2-divisibility
Perfect divisibility and 2-divisibility Maria Chudnovsky Princeton University, Princeton, NJ 08544, USA Vaidy Sivaraman Binghamton University, Binghamton, NY 13902, USA April 20, 2017 Abstract A graph
More informationf 0 (a,b,c,w,x,y,z) = ay cxy bw bz is a read-once function since it can be factored into the expression
Chapter 10 Read-once functions Martin C. Golumbic and Vladimir Gurvich 10.1 Introduction In this chapter, we present the theory and applications of read-once Boolean functions, one of the most interesting
More informationR(p, k) = the near regular complete k-partite graph of order p. Let p = sk+r, where s and r are positive integers such that 0 r < k.
MATH3301 EXTREMAL GRAPH THEORY Definition: A near regular complete multipartite graph is a complete multipartite graph with orders of its partite sets differing by at most 1. R(p, k) = the near regular
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationExact Algorithms for Dominating Induced Matching Based on Graph Partition
Exact Algorithms for Dominating Induced Matching Based on Graph Partition Mingyu Xiao School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731,
More information