DOCSLIB.ORG

Graph Theory

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Graph Theory Graph Theory Perfect Graphs PLANARITY 2 PERFECT GRAPHS Perfect Graphs • A perfect graph is a graph in which the chromatic number of every induced subgraph equals the size of the largest clique of that subgraph (clique number). • An arbitrary graph 퐺 is perfect if and only if we have: ∀ 푆 ⊆ 푉 퐺 휒 퐺 푆 = 휔 퐺 푆 • Theorem 1 (Perfect Graph Theorem) A graph 퐺 is perfect if and only if its complement 퐺 is perfect • Theorem 2 (Strong Perfect Graph Theorem) Perfect graphs are the same as Berge graphs, which are graphs 퐺 where neither 퐺 nor 퐺 contain an induced cycle of odd length 5 or more. 3 PERFECT GRAPHS Perfect Graphs Perfect Comparability Chordal Bipartite Permutation Split Interval Chordal Cograph Bipartite Convex Quasi- Bipartite Thresshold Biconvex Thresshold Bipartite Bipartite 4 Permutation PERFECT GRAPHS Intersection Graphs • Let 퐹 be a family of nonempty sets. The intersection graph of 퐹 is obtained be representing each set in 퐹 by a vertex: 푥 → 푦 ⇔ 푆푋∩푆푌 ≠ ∅ • The intersection graph of a family of intervals on a linearly ordered set (like the real line) is called an Interval graph. • An induced subgraph of an interval graph is an interval graph. 5 PERFECT GRAPHS Intersection Graphs • Let 퐹 be a family of nonempty sets. The intersection graph of 퐹 is obtained be representing each set in 퐹 by a vertex: 푥 → 푦 ⇔ 푆푋∩푆푌 ≠ ∅ • Circular-arc graphs properly contain the internal graphs. 6 PERFECT GRAPHS Intersection Graphs • Let 퐹 be a family of nonempty sets. The intersection graph of 퐹 is obtained be representing each set in 퐹 by a vertex: 푥 → 푦 ⇔ 푆푋∩푆푌 ≠ ∅ • A permutation diagram consists of n points on each of two parallel lines and n straight line segments matching the points. 7 PERFECT GRAPHS Intersection Graphs • Let 퐹 be a family of nonempty sets. The intersection graph of 퐹 is obtained be representing each set in 퐹 by a vertex: 푥 → 푦 ⇔ 푆푋∩푆푌 ≠ ∅ • Intersecting chords of a circle 8 PERFECT GRAPHS Triangulated Graph Property • Every simple cycle of length 푙 > 3 possesses a chord. • Triangulated graphs (or chordal graphs) 9 PERFECT GRAPHS Transitive Orientation Property • Each edge can be assigned a one-way direction in such a way that the resulting oriented graph (푉, 퐹): 푎푏 ∈ 퐹 푎푛푑 푏푐 ∈ 퐹 ⇒ 푎푐 ∈ 퐹 (∀ 푎, 푏, 푐 ∈ 푉) • Comparability graphs satisfy the transitive orientation property. 10 PERFECT GRAPHS Transitive Orientation Property • Each edge can be assigned a one-way direction in such a way that the resulting oriented graph (푉, 퐹): 푎푏 ∈ 퐹 푎푛푑 푏푐 ∈ 퐹 ⇒ 푎푐 ∈ 퐹 (∀ 푎, 푏, 푐 ∈ 푉) • Comparability graphs satisfy the transitive orientation property. 11 PERFECT GRAPHS Basic Numbers in Graphs • Clique number 흎(푮): the number of vertices in a maximum clique of 퐺 • Stability number 휶(푮): the number of vertices in a stable set of max cardinality 12 PERFECT GRAPHS Basic Numbers in Graphs • Clique number 흎(푮): the number of vertices in a maximum clique of 퐺 • Stability number 휶(푮): the number of vertices in a stable set of max cardinality • A clique cover of size 푘 is a partition 푉 = 퐶1 + 퐶2 + ⋯ + 퐶푘 such that 퐶푖 is a clique. • A proper coloring of size 푐 (proper 푐-coloring) is a partition 푉 = 푋1 + 푋2 + ⋯ + 푋푐 such that 푋푖 is a stable set. • Clique cover number 휿(푮) is the size of the smallest possible clique cover of 퐺 • Chromatic number 흌(푮) the smallest possible 푐 for which there exists a proper c-coloring of 퐺. 13 PERFECT GRAPHS Basic Numbers in Graphs • Clique number 흎(푮): the number of vertices in a maximum clique of 퐺 • Stability number 휶(푮): the number of vertices in a stable set of max cardinality • Clique cover number 휿(푮) is the size of the smallest possible clique cover of 퐺 • Chromatic number 흌(푮) the smallest possible 푐 for which there exists a proper c-coloring of 퐺. ---------------------------------------------------------------------------------------------- For any graph 퐺 it holds that: 흎(푮) ≤ 흌(푮) and 휶(푮) ≤ 휿(푮), while, 휶(푮) = 흎(푮 ) and 휿(푮) = 흌(푮 ) 14 PERFECT GRAPHS Basic Numbers in Perfect Graphs • Clique number 흎(푮): the number of vertices in a maximum clique of 퐺 • Stability number 휶(푮): the number of vertices in a stable set of max cardinality • Clique cover number 휿(푮) is the size of the smallest possible clique cover of 퐺 • Chromatic number 흌(푮) the smallest possible 푐 for which there exists a proper c-coloring of 퐺. ---------------------------------------------------------------------------------------------- • 흌 −Perfect property: For each induced subgraph 퐺퐴 of 퐺 휒(퐺퐴) = 휔(퐺퐴) • 휶 −Perfect property : For each induced subgraph 퐺퐴 of 퐺 15 훼(퐺퐴) = 휅(퐺퐴) PERFECT GRAPHS Basic Numbers in Perfect Graphs • Clique number 흎(푮): the number of vertices in a maximum clique of 퐺 • Stability number 휶(푮): the number of vertices in a stable set of max cardinality • Clique cover number 휿(푮) is the size of the smallest possible clique cover of 퐺 • Chromatic number 흌(푮) the smallest possible 푐 for which there exists a proper c-coloring of 퐺. ---------------------------------------------------------------------------------------------- Let 퐺 = (푉, 퐸) be an undirected graph: 푃 1 흎 푮푨 = 흌 푮푨 ∀ 퐴 ∈ 푉 푃 2 휶 푮푨 = 휿 푮푨 ∀ 퐴 ∈ 푉 퐺 is called Perfect 16 PERFECT GRAPHS Triangulated Graphs • Triangulated graphs, or Chordal graphs, or Perfect Elimination graphs: 퐺 triangulated ⇔ 퐺 has the triangulated graph property (i.e., Every simple cycle of length 푙 > 3 possesses a chord) 17 PERFECT GRAPHS Triangulated Graphs • Triangulated graphs, or Chordal graphs, or Perfect Elimination graphs: 퐺 triangulated ⇔ 퐺 has the triangulated graph property (i.e., Every simple cycle of length 푙 > 3 possesses a chord) • Dirac showed that: every chordal graph has a simplicial node, a node all of whose neighbors form a clique. 18 PERFECT GRAPHS Triangulated Graphs • Triangulated graphs, or Chordal graphs, or Perfect Elimination graphs: 퐺 triangulated ⇔ 퐺 has the triangulated graph property (i.e., Every simple cycle of length 푙 > 3 possesses a chord) • Dirac showed that: every chordal graph has a simplicial node, a node all of whose neighbors form a clique. 19 PERFECT GRAPHS Triangulated Graphs • Triangulated graphs, or Chordal graphs, or Perfect Elimination graphs: 퐺 triangulated ⇔ 퐺 has the triangulated graph property (i.e., Every simple cycle of length 푙 > 3 possesses a chord) • Dirac showed that: every chordal graph has a simplicial node, a node all of whose neighbors form a clique. • It follows easily from the triangulated property that deleting nodes of a chordal graph yields another chordal graph. 20 PERFECT GRAPHS Triangulated Graphs • Triangulated graphs, or Chordal graphs, or Perfect Elimination graphs: 퐺 triangulated ⇔ 퐺 has the triangulated graph property (i.e., Every simple cycle of length 푙 > 3 possesses a chord) • Recognition Algorithm : 1. Find a simplicial node of 퐺 2. Delete it from 퐺, resulting 퐺’ 3. Recourse on the resulting graph 퐺’, until no node remain 21 PERFECT GRAPHS Triangulated Graphs • Triangulated graphs, or Chordal graphs, or Perfect Elimination graphs: 퐺 triangulated ⇔ 퐺 has the triangulated graph property (i.e., Every simple cycle of length 푙 > 3 possesses a chord) • Recognition Algorithm : 1. Find a simplicial node of 퐺 2. Delete it from 퐺, resulting 퐺’ 3. Recourse on the resulting graph 퐺’, until no node remain • Node-Ordering: perfect elimination ordering (PEO), or perfect elimination scheme. 22 PERFECT GRAPHS Triangulated Graphs • Triangulated graphs, or Chordal graphs, or Perfect Elimination graphs: 퐺 triangulated ⇔ 퐺 has the triangulated graph property (i.e., Every simple cycle of length 푙 > 3 possesses a chord) • Node-Ordering: perfect elimination ordering (PEO), or perfect elimination scheme. • Let 휎 = [푣1, 푣2, … , 푣푛] be an ordering of the vertices of a graph 퐺 푉, 퐸 , then 휎 = peo if each 풗풊 is a simplicial node to graph 퐺 푣푖, 푣푖+1, … , 푣푛 . 23 PERFECT GRAPHS Triangulated Graphs • Triangulated graphs, or Chordal graphs, or Perfect Elimination graphs: 퐺 triangulated ⇔ 퐺 has the triangulated graph property (i.e., Every simple cycle of length 푙 > 3 possesses a chord) • Node-Ordering: perfect elimination ordering (PEO), or perfect elimination scheme. • Let 휎 = [푣1, 푣2, … , 푣푛] be an ordering of the vertices of a graph 퐺 푉, 퐸 , then 휎 = peo if each 풗풊 is a simplicial node to graph 퐺 푣푖, 푣푖+1, … , 푣푛 . 24 PERFECT GRAPHS Triangulated Graphs • Triangulated graphs, or Chordal graphs, or Perfect Elimination graphs: 퐺 triangulated ⇔ 퐺 has the triangulated graph property (i.e., Every simple cycle of length 푙 > 3 possesses a chord) • Node-Ordering: perfect elimination ordering (PEO), or perfect elimination scheme. • Let 휎 = [푣1, 푣2, … , 푣푛] be an ordering of the vertices of a graph 퐺 푉, 퐸 , then 휎 = peo if each 풗풊 is a simplicial node to graph 퐺 푣푖, 푣푖+1, … , 푣푛 . 1 3 5 7 휎 = [1, 7, 2, 6, 3, 5, 4] 퐺1 has 96 different peo 25 2 4 6 PERFECT GRAPHS Triangulated Graphs • LexBFS Algorithm • Algorithm LexBFS: 1. for all 푣 ∈ 푉 do 푙푎푏푒푙(푣) ∶ = () ; 2. for 푖 ∶ = |푉| down to 1 do 1) select 푣 ∈ 푉 with lexmax 푙푎푏푒푙 (푣); 2) 휎 (푖) ← 푣; 3) for all 푢 ∈ 푉 ∩ 푁(푣) do 4) 푙푎푏푒푙 (푢) ← 푙푎푏푒푙 (푢) || 푖 5) 푉 ← 푉 \{푣}; end 26 PERFECT GRAPHS Triangulated Graphs • MCS Algorithm • Algorithm MCS: 1. for 푖 ∶ = |푉| down to 1 do 1) select 푣 ∈ 푉 with max number of numbered neighbors; 2) number 푣 by 푖 3) 휎 (푖) ← 푣; 4) 푉 ← 푉 \ {푣}; end 27 PERFECT GRAPHS Properties • Definition: A subset 푆 of vertices is called a Vertex Separator for nonadjacent vertices 푎, 푏 or, equivalently, 풂 − 풃 separator, if in graph 퐺푉−푆 vertices 푎 and 푏 are in different connected components.
Load more

Recommended publications
  • Mutant Knots and Intersection Graphs 1 Introduction
    Mutant knots and intersection graphs S. V. CHMUTOV S. K. LANDO We prove that if a finite order knot invariant does not distinguish mutant knots, then the corresponding weight system depends on the intersection graph of a chord diagram rather than on the diagram itself. Conversely, if we have a weight system depending only on the intersection graphs of chord diagrams, then the composition of such a weight system with the Kontsevich invariant determines a knot invariant that does not distinguish mutant knots. Thus, an equivalence between finite order invariants not distinguishing mutants and weight systems depending on intersections graphs only is established. We discuss relationship between our results and certain Lie algebra weight systems. 57M15; 57M25 1 Introduction Below, we use standard notions of the theory of finite order, or Vassiliev, invariants of knots in 3-space; their definitions can be found, for example, in [6] or [14], and we recall them briefly in Section 2. All knots are assumed to be oriented. Two knots are said to be mutant if they differ by a rotation of a tangle with four endpoints about either a vertical axis, or a horizontal axis, or an axis perpendicular to the paper. If necessary, the orientation inside the tangle may be replaced by the opposite one. Here is a famous example of mutant knots, the Conway (11n34) knot C of genus 3, and Kinoshita–Terasaka (11n42) knot KT of genus 2 (see [1]). C = KT = Note that the change of the orientation of a knot can be achieved by a mutation in the complement to a trivial tangle.
    [Show full text]
  • Induced Minors and Well-Quasi-Ordering Jaroslaw Blasiok, Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck
    Induced minors and well-quasi-ordering Jaroslaw Blasiok, Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck To cite this version: Jaroslaw Blasiok, Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck. Induced minors and well-quasi-ordering. EuroComb: European Conference on Combinatorics, Graph Theory and Appli- cations, Aug 2015, Bergen, Norway. pp.197-201, 10.1016/j.endm.2015.06.029. lirmm-01349277 HAL Id: lirmm-01349277 https://hal-lirmm.ccsd.cnrs.fr/lirmm-01349277 Submitted on 27 Jul 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Available online at www.sciencedirect.com www.elsevier.com/locate/endm Induced minors and well-quasi-ordering Jaroslaw Blasiok 1,2 School of Engineering and Applied Sciences, Harvard University, United States Marcin Kami´nski 2 Institute of Computer Science, University of Warsaw, Poland Jean-Florent Raymond 2 Institute of Computer Science, University of Warsaw, Poland, and LIRMM, University of Montpellier, France Th´eophile Trunck 2 LIP, ENS´ de Lyon, France Abstract AgraphH is an induced minor of a graph G if it can be obtained from an induced subgraph of G by contracting edges. Otherwise, G is said to be H-induced minor- free.
    [Show full text]
  • Arxiv:1907.08517V3 [Math.CO] 12 Mar 2021
    RANDOM COGRAPHS: BROWNIAN GRAPHON LIMIT AND ASYMPTOTIC DEGREE DISTRIBUTION FRÉDÉRIQUE BASSINO, MATHILDE BOUVEL, VALENTIN FÉRAY, LUCAS GERIN, MICKAËL MAAZOUN, AND ADELINE PIERROT ABSTRACT. We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphons. We then show that the degree of a uniform random vertex in a uniform cograph is of order n, and converges after normalization to the Lebesgue measure on [0; 1]. We finally an- alyze the vertex connectivity (i.e. the minimal number of vertices whose removal disconnects the graph) of random connected cographs, and show that this statistics converges in distribution without renormalization. Unlike for the graphon limit and for the degree of a random vertex, the limiting distribution of the vertex connectivity is different in the labeled and unlabeled settings. Our proofs rely on the classical encoding of cographs via cotrees. We then use mainly combi- natorial arguments, including the symbolic method and singularity analysis. 1. INTRODUCTION 1.1. Motivation. Random graphs are arguably the most studied objects at the interface of com- binatorics and probability theory. One aspect of their study consists in analyzing a uniform random graph of large size n in a prescribed family, e.g. perfect graphs [MY19], planar graphs [Noy14], graphs embeddable in a surface of given genus [DKS17], graphs in subcritical classes [PSW16], hereditary classes [HJS18] or addable classes [MSW06, CP19]. The present paper focuses on uniform random cographs (both in the labeled and unlabeled settings). Cographs were introduced in the seventies by several authors independently, see e.g.
    [Show full text]
  • A Class of Hypergraphs That Generalizes Chordal Graphs
    MATH. SCAND. 106 (2010), 50–66 A CLASS OF HYPERGRAPHS THAT GENERALIZES CHORDAL GRAPHS ERIC EMTANDER Abstract In this paper we introduce a class of hypergraphs that we call chordal. We also extend the definition of triangulated hypergraphs, given by H. T. Hà and A. Van Tuyl, so that a triangulated hypergraph, according to our definition, is a natural generalization of a chordal (rigid circuit) graph. R. Fröberg has showed that the chordal graphs corresponds to graph algebras, R/I(G), with linear resolu- tions. We extend Fröberg’s method and show that the hypergraph algebras of generalized chordal hypergraphs, a class of hypergraphs that includes the chordal hypergraphs, have linear resolutions. The definitions we give, yield a natural higher dimensional version of the well known flag property of simplicial complexes. We obtain what we call d-flag complexes. 1. Introduction and preliminaries Let X be a finite set and E ={E1,...,Es } a finite collection of non empty subsets of X . The pair H = (X, E ) is called a hypergraph. The elements of X and E , respectively, are called the vertices and the edges, respectively, of the hypergraph. If we want to specify what hypergraph we consider, we may write X (H ) and E (H ) for the vertices and edges respectively. A hypergraph is called simple if: (1) |Ei |≥2 for all i = 1,...,s and (2) Ej ⊆ Ei only if i = j. If the cardinality of X is n we often just use the set [n] ={1, 2,...,n} instead of X . Let H be a hypergraph. A subhypergraph K of H is a hypergraph such that X (K ) ⊆ X (H ), and E (K ) ⊆ E (H ).IfY ⊆ X , the induced hypergraph on Y, HY , is the subhypergraph with X (HY ) = Y and with E (HY ) consisting of the edges of H that lie entirely in Y.
    [Show full text]
  • Partitioning a Graph Into Disjoint Cliques and a Triangle-Free Graph
    This is a repository copy of Partitioning a graph into disjoint cliques and a triangle-free graph. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/85292/ Version: Accepted Version Article: Abu-Khzam, FN, Feghali, C and Muller, H (2015) Partitioning a graph into disjoint cliques and a triangle-free graph. Discrete Applied Mathematics, 190-19. 1 - 12. ISSN 0166-218X https://doi.org/10.1016/j.dam.2015.03.015 © 2015, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/ Reuse Unless indicated otherwise, fulltext items are protected by copyright with all rights reserved. The copyright exception in section 29 of the Copyright, Designs and Patents Act 1988 allows the making of a single copy solely for the purpose of non-commercial research or private study within the limits of fair dealing. The publisher or other rights-holder may allow further reproduction and re-use of this version - refer to the White Rose Research Online record for this item. Where records identify the publisher as the copyright holder, users can verify any specific terms of use on the publisher’s website. Takedown If you consider content in White Rose Research Online to be in breach of UK law, please notify us by emailing [email protected] including the URL of the record and the reason for the withdrawal request. [email protected] https://eprints.whiterose.ac.uk/ Partitioning a Graph into Disjoint Cliques and a Triangle-free Graph Faisal N. Abu-Khzam, Carl Feghali, Haiko M¨uller Abstract A graph G =(V, E) is partitionable if there exists a partition {A,B} of V such that A induces a disjoint union of cliques and B induces a triangle- free graph.
    [Show full text]
  • Representations of Edge Intersection Graphs of Paths in a Tree Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
    Representations of Edge Intersection Graphs of Paths in a Tree Martin Charles Golumbic, Marina Lipshteyn, Michal Stern To cite this version: Martin Charles Golumbic, Marina Lipshteyn, Michal Stern. Representations of Edge Intersection Graphs of Paths in a Tree. 2005 European Conference on Combinatorics, Graph Theory and Appli- cations (EuroComb ’05), 2005, Berlin, Germany. pp.87-92. hal-01184396 HAL Id: hal-01184396 https://hal.inria.fr/hal-01184396 Submitted on 14 Aug 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. EuroComb 2005 DMTCS proc. AE, 2005, 87–92 Representations of Edge Intersection Graphs of Paths in a Tree Martin Charles Golumbic1,† Marina Lipshteyn1 and Michal Stern1 1Caesarea Rothschild Institute, University of Haifa, Haifa, Israel Let P be a collection of nontrivial simple paths in a tree T . The edge intersection graph of P, denoted by EP T (P), has vertex set that corresponds to the members of P, and two vertices are joined by an edge if the corresponding members of P share a common edge in T . An undirected graph G is called an edge intersection graph of paths in a tree, if G = EP T (P) for some P and T .
    [Show full text]
  • Arxiv:1906.05510V2 [Math.AC]
    BINOMIAL EDGE IDEALS OF COGRAPHS THOMAS KAHLE AND JONAS KRUSEMANN¨ Abstract. We determine the Castelnuovo–Mumford regularity of binomial edge ideals of complement reducible graphs (cographs). For cographs with n vertices the maximum regularity grows as 2n/3. We also bound the regularity by graph theoretic invariants and construct a family of counterexamples to a conjecture of Hibi and Matsuda. 1. Introduction Let G = ([n], E) be a simple undirected graph on the vertex set [n]= {1,...,n}. x1 ··· xn x1 ··· xn Let X = ( y1 ··· yn ) be a generic 2 × n matrix and S = k[ y1 ··· yn ] the polynomial ring whose indeterminates are the entries of X and with coefficients in a field k. The binomial edge ideal of G is JG = hxiyj −yixj : {i, j} ∈ Ei⊆ S, the ideal of 2×2 mi- nors indexed by the edges of the graph. Since their inception in [5, 15], connecting combinatorial properties of G with algebraic properties of JG or S/ JG has been a popular activity. Particular attention has been paid to the minimal free resolution of S/ JG as a standard N-graded S-module [3, 11]. The data of a minimal free res- olution is encoded in its graded Betti numbers βi,j (S/ JG) = dimk Tori(S/ JG, k)j . An interesting invariant is the highest degree appearing in the resolution, the Castelnuovo–Mumford regularity reg(S/ JG) = max{j − i : βij (S/ JG) 6= 0}. It is a complexity measure as low regularity implies favorable properties like vanish- ing of local cohomology. Binomial edge ideals have square-free initial ideals by arXiv:1906.05510v2 [math.AC] 10 Mar 2021 [5, Theorem 2.1] and, using [1], this implies that the extremal Betti numbers and regularity can also be derived from those initial ideals.
    [Show full text]
  • NP-Complete and Cliques
    CSC373— Algorithm Design, Analysis, and Complexity — Spring 2018 Tutorial Exercise 10: Cliques and Intersection Graphs for Intervals 1. Clique. Given an undirected graph G = (V,E) a clique (pronounced “cleek” in Canadian, heh?) is a subset of vertices K ⊆ V such that, for every pair of distinct vertices u,v ∈ K, the edge (u,v) is in E. See Clique, Graph Theory, Wikipedia. A second concept that will be useful is the notion of a complement graph Gc. We say Gc is the complement (graph) of G = (V,E) iff Gc = (V,Ec), where Ec = {(u,v) | u,v ∈ V,u 6= v, and (u,v) ∈/ E} (see Complement Graph, Wikipedia). That is, the complement graph Gc is the graph over the same set of vertices, but it contains all (and only) the edges that are not in E. Finally, a clique K ⊂ V of G =(V,E) is said to be a maximal clique iff there is no superset W such that K ⊂ W ⊆ V and W is a clique of G. Consider the decision problem: Clique: Given an undirected graph and an integer k, does there exist a clique K of G with |K|≥ k? Clearly, Clique is in NP. We wish to show that Clique is NP-complete. To do this, it is convenient to first note that the independent set problem IndepSet(G, k) is very closely related to the Clique problem for the complement graph, i.e., Clique(Gc,k). Use this strategy to show: IndepSet ≡p Clique. (1) 2. Consider the interval scheduling problem we started this course with (which is also revisited in Assignment 3, Question 1).
    [Show full text]
  • P 4-Colorings and P 4-Bipartite Graphs Chinh T
    P_4-Colorings and P_4-Bipartite Graphs Chinh T. Hoàng, van Bang Le To cite this version: Chinh T. Hoàng, van Bang Le. P_4-Colorings and P_4-Bipartite Graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2001, 4 (2), pp.109-122. hal-00958951 HAL Id: hal-00958951 https://hal.inria.fr/hal-00958951 Submitted on 13 Mar 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Discrete Mathematics and Theoretical Computer Science 4, 2001, 109–122 P4-Free Colorings and P4-Bipartite Graphs Ch´ınh T. Hoang` 1† and Van Bang Le2‡ 1Department of Physics and Computing, Wilfrid Laurier University, 75 University Ave. W., Waterloo, Ontario N2L 3C5, Canada 2Fachbereich Informatik, Universitat¨ Rostock, Albert-Einstein-Straße 21, D-18051 Rostock, Germany received May 19, 1999, revised November 25, 2000, accepted December 15, 2000. A vertex partition of a graph into disjoint subsets Vis is said to be a P4-free coloring if each color class Vi induces a subgraph without a chordless path on four vertices (denoted by P4). Examples of P4-free 2-colorable graphs (also called P4-bipartite graphs) include parity graphs and graphs with “few” P4s like P4-reducible and P4-sparse graphs.
    [Show full text]
  • Characterization and Recognition of P4-Sparse Graphs Partitionable Into K Independent Sets and ℓ Cliques✩
    Discrete Applied Mathematics 159 (2011) 165–173 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Characterization and recognition of P4-sparse graphs partitionable into k independent sets and ` cliquesI Raquel S.F. Bravo a, Sulamita Klein a, Loana Tito Nogueira b, Fábio Protti b,∗ a COPPE-PESC, Universidade Federal do Rio de Janeiro, Brazil b IC, Universidade Federal Fluminense, Brazil article info a b s t r a c t Article history: In this work, we focus on the class of P4-sparse graphs, which generalizes the well-known Received 28 December 2009 class of cographs. We consider the problem of verifying whether a P4-sparse graph is a Received in revised form 22 October 2010 .k; `/-graph, that is, a graph that can be partitioned into k independent sets and ` cliques. Accepted 28 October 2010 First, we describe in detail the family of forbidden induced subgraphs for a cograph to be Available online 27 November 2010 a .k; `/-graph. Next, we show that the same forbidden structures suffice to characterize P -sparse graphs which are .k; `/-graphs. Finally, we describe how to recognize .k; `/-P - Keywords: 4 4 sparse graphs in linear time by using special auxiliary cographs. .k; `/-graphs Cographs ' 2010 Elsevier B.V. All rights reserved. P4-sparse graphs 1. Introduction The class of P4-sparse graphs was introduced by Hoàng [14] as the class of graphs for which every set of five vertices induces at most one P4. Hoàng also gave a number of characterizations for these graphs, and showed that P4-sparse graphs are perfect (a graph G is perfect if for every induced subgraph H of G, the chromatic number of H equals the largest number of pairwise adjacent vertices in H).
    [Show full text]
  • Generalizing Cographs to 2-Cographs
    GENERALIZING COGRAPHS TO 2-COGRAPHS JAMES OXLEY AND JAGDEEP SINGH Abstract. In this paper, we consider 2-cographs, a natural general- ization of the well-known class of cographs. We show that, as with cographs, 2-cographs can be recursively defined. However, unlike cographs, 2-cographs are closed under induced minors. We consider the class of non-2-cographs for which every proper induced minor is a 2-cograph and show that this class is infinite. Our main result finds the finitely many members of this class whose complements are also induced-minor-minimal non-2-cographs. 1. Introduction In this paper, we only consider simple graphs. Except where indicated otherwise, our notation and terminology will follow [5]. A cograph is a graph in which every connected induced subgraph has a disconnected com- plement. By convention, the graph K1 is assumed to be a cograph. Re- placing connectedness by 2-connectedness, we define a graph G to be a 2-cograph if G has no induced subgraph H such that both H and its com- plement, H, are 2-connected. Note that K1 is a 2-cograph. Cographs have been extensively studied over the last fifty years (see, for example, [6, 12, 4]). They are also called P4-free graphs due to following characterization [3]. Theorem 1.1. A graph G is a cograph if and only if G does not contain the path P4 on four vertices as an induced subgraph. In other words, P4 is the unique non-cograph with the property that every proper induced subgraph of P4 is a cograph.
    [Show full text]
  • On Intersection Graphs of Graphs and Hypergraphs: a Survey
    Intersection Graphs of Graphs and Hypergraphs: A Survey Ranjan N. Naika aDepartment of Mathematics, Lincoln University, PA, USA [email protected] Abstract The survey is devoted to the developmental milestones on the characterizations of intersection graphs of graphs and hypergraphs. The theory of intersection graphs of graphs and hypergraphs has been a classical topic in the theory of special graphs. To conclude, at the end, we have listed some open problems posed by various authors whose work has contributed to this survey and also the new trends coming out of intersection graphs of hyeprgraphs. Keywords: Hypergraphs, Intersection graphs, Line graphs, Representative graphs, Derived graphs, Algorithms (ALG),, Forbidden induced subgraphs (FIS), Krausz partitions, Eigen values Mathematics Subject Classification : 06C62, 05C65, 05C75, 05C85, 05C69 1. Introduction We follow the terminology of Berge, C. [3] and [4]. This survey does not address intersection graphs of other types of graphs such as interval graphs etc. An introduction of intersection graphs of interval graphs etc. are available in Pal [40]. A graph or a hypergraph is a pair (V, E), where V is the vertex set and E is the edge set a family of nonempty subsets of V. Two edges of a hypergraph are l -intersecting if they share at least l common vertices. This concept was studied in [6] and [18] by Bermond, Heydemann and Sotteau. A hypergraph H is called a k-uniform hypergraph if its edges have k number of vertices. A hypergraph is linear if any two edges have at most one common vertex. A 2-uniform linear hypergraph is called a graph or a linear graph.
    [Show full text]