A structure theorem for graphs with no cycle with a unique chord and its consequences
AbstractWe give a structural description of the class C of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in C is a either in some simple basic class or has a decomposition. Basic classes are cliques, bipartite graphs with one side containing only nodes of degree two and induced subgraph of the famous Heawood or Petersen graph. Decompositions are node cutsets consisting of one or two nodes and edge cutsets called 1-joins. Our decomposition theorem actually gives a complete structure theorem for C, i.e. every graph in C can be built from basic graphs that can be explicitly constructed, and gluing them together by prescribed composition operations ; and all graphs built this way are in C. This has several consequences : an O(nm)-time algorithm to decide whether a graph is in C, an O(n+m)-time algorithm that finds a maximum clique of any graph in C and an O(nm)-time coloring algorithm for graphs in C. We prove that every graph in C is either 3-colorable or has a coloring with ? colors where ? is the size of a largest clique. The problem of finding a maximum stable set for a graph in C is known to be NP-hard.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne in its series Documents de travail du Centre d'Economie de la Sorbonne with number b08021.
Length: 43 pages
Date of creation: Mar 2008
Date of revision:
Contact details of provider:
Postal: 106-112 boulevard de l'Hôpital 75 647 PARIS CEDEX 13
Phone: + 33 44 07 81 00
Fax: + 33 1 44 07 83 01
Web page: http://centredeconomiesorbonne.univ-paris1.fr/
More information through EDIRC
Cycle with a unique chord; decomposition; structure; detection; recognition; Heawood graph; Petersen graph; coloring.;
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lucie Label).
If references are entirely missing, you can add them using this form.