Bull-Reducible Berge Graphs are Perfect
Identifieur interne : 001337 ( Hal/Corpus ); précédent : 001336; suivant : 001338Bull-Reducible Berge Graphs are Perfect
Auteurs : Hazel Everett ; Celina De Figueiredo ; Sulamita Klein ; Bruce ReedSource :
English descriptors
Abstract
Berge's well known SPGC (Strong Perfect Graph Conjecture) states that the class of perfect graphs coincides with the class of graphs containing no induced odd cycle of length at least 5 or the complement of such a cycle. A graph in this second class is called Berge. A bull is a graph with five vertices x, a, b, c, d and five edges xa, xb, ab, ad, bc. A graph is bull-reducible if no vertex is in two bulls. We prove that every bull-reducible Berge graph is perfect and we exhibit a polynomial-time recognition algorithm for bull-reducible Berge graphs.
Url:
Links to Exploration step
Hal:inria-00100577Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Bull-Reducible Berge Graphs are Perfect</title><author><name sortKey="Everett, Hazel" sort="Everett, Hazel" uniqKey="Everett H" first="Hazel" last="Everett">Hazel Everett</name><affiliation><hal:affiliation type="researchteam" xml:id="struct-2350" status="OLD"><idno type="RNSR">199521440F</idno><orgName>Models, algorithms and geometry for computer graphics and vision</orgName><orgName type="acronym">ISA</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/isa</ref></desc><listRelation><relation active="#struct-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></relation><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation></affiliation></author><author><name sortKey="De Figueiredo, Celina" sort="De Figueiredo, Celina" uniqKey="De Figueiredo C" first="Celina" last="De Figueiredo">Celina De Figueiredo</name></author><author><name sortKey="Klein, Sulamita" sort="Klein, Sulamita" uniqKey="Klein S" first="Sulamita" last="Klein">Sulamita Klein</name></author><author><name sortKey="Reed, Bruce" sort="Reed, Bruce" uniqKey="Reed B" first="Bruce" last="Reed">Bruce Reed</name></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00100577</idno><idno type="halId">inria-00100577</idno><idno type="halUri">https://hal.inria.fr/inria-00100577</idno><idno type="url">https://hal.inria.fr/inria-00100577</idno><date when="2001">2001</date><idno type="wicri:Area/Hal/Corpus">001337</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Bull-Reducible Berge Graphs are Perfect</title><author><name sortKey="Everett, Hazel" sort="Everett, Hazel" uniqKey="Everett H" first="Hazel" last="Everett">Hazel Everett</name><affiliation><hal:affiliation type="researchteam" xml:id="struct-2350" status="OLD"><idno type="RNSR">199521440F</idno><orgName>Models, algorithms and geometry for computer graphics and vision</orgName><orgName type="acronym">ISA</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/isa</ref></desc><listRelation><relation active="#struct-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></relation><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation></affiliation></author><author><name sortKey="De Figueiredo, Celina" sort="De Figueiredo, Celina" uniqKey="De Figueiredo C" first="Celina" last="De Figueiredo">Celina De Figueiredo</name></author><author><name sortKey="Klein, Sulamita" sort="Klein, Sulamita" uniqKey="Klein S" first="Sulamita" last="Klein">Sulamita Klein</name></author><author><name sortKey="Reed, Bruce" sort="Reed, Bruce" uniqKey="Reed B" first="Bruce" last="Reed">Bruce Reed</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>bull-free graphs</term><term>bull-reducible graphs.</term><term>graphes parfaits</term><term>perfect graphs</term><term>star cutsets</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Berge's well known SPGC (Strong Perfect Graph Conjecture) states that the class of perfect graphs coincides with the class of graphs containing no induced odd cycle of length at least 5 or the complement of such a cycle. A graph in this second class is called Berge. A bull is a graph with five vertices x, a, b, c, d and five edges xa, xb, ab, ad, bc. A graph is bull-reducible if no vertex is in two bulls. We prove that every bull-reducible Berge graph is perfect and we exhibit a polynomial-time recognition algorithm for bull-reducible Berge graphs.</div></front></TEI><hal api="V3"><titleStmt><title xml:lang="en">Bull-Reducible Berge Graphs are Perfect</title><author role="aut"><persName><forename type="first">Hazel</forename><surname>Everett</surname></persName><email>Hazel.Everett@loria.fr</email><idno type="halauthor">61496</idno><orgName ref="#struct-300292"></orgName><affiliation ref="#struct-2350"></affiliation></author><author role="aut"><persName><forename type="first">Celina</forename><surname>De Figueiredo</surname></persName><email></email><idno type="halauthor">131832</idno><orgName ref="#struct-365126"></orgName></author><author role="aut"><persName><forename type="first">Sulamita</forename><surname>Klein</surname></persName><email></email><idno type="halauthor">131833</idno><orgName ref="#struct-365126"></orgName></author><author role="aut"><persName><forename type="first">Bruce</forename><surname>Reed</surname></persName><email></email><idno type="halauthor">131834</idno><orgName ref="#struct-365127"></orgName></author><editor role="depositor"><persName><forename>Publications</forename><surname>Loria</surname></persName><email>publications@loria.fr</email></editor></titleStmt><editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2006-09-26 14:47:48</date><date type="whenModified">2016-05-19 01:09:07</date><date type="whenReleased">2006-09-28 15:22:47</date><date type="whenProduced">2001</date></edition><respStmt><resp>contributor</resp><name key="108626"><persName><forename>Publications</forename><surname>Loria</surname></persName><email>publications@loria.fr</email></name></respStmt></editionStmt><publicationStmt><distributor>CCSD</distributor><idno type="halId">inria-00100577</idno><idno type="halUri">https://hal.inria.fr/inria-00100577</idno><idno type="halBibtex">everett:inria-00100577</idno><idno type="halRefHtml">Euroconference on Combinatorics, Graph Theory and Applications - COMB'01, 2001, Barcelone, Spain, 3 p, 2001</idno><idno type="halRef">Euroconference on Combinatorics, Graph Theory and Applications - COMB'01, 2001, Barcelone, Spain, 3 p, 2001</idno></publicationStmt><seriesStmt><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno><idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno><idno type="stamp" n="LORIA2">Publications du LORIA</idno><idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno><idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno><idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno><idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno><idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno></seriesStmt><notesStmt><note type="commentary">Colloque sans acte à diffusion restreinte. internationale.</note><note type="audience" n="2">International</note><note type="invited" n="0">No</note><note type="popular" n="0">No</note><note type="peer" n="1">Yes</note><note type="proceedings" n="1">Yes</note></notesStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Bull-Reducible Berge Graphs are Perfect</title><author role="aut"><persName><forename type="first">Hazel</forename><surname>Everett</surname></persName><email>Hazel.Everett@loria.fr</email><idno type="halAuthorId">61496</idno><orgName ref="#struct-300292"></orgName><affiliation ref="#struct-2350"></affiliation></author><author role="aut"><persName><forename type="first">Celina</forename><surname>De Figueiredo</surname></persName><idno type="halAuthorId">131832</idno><orgName ref="#struct-365126"></orgName></author><author role="aut"><persName><forename type="first">Sulamita</forename><surname>Klein</surname></persName><idno type="halAuthorId">131833</idno><orgName ref="#struct-365126"></orgName></author><author role="aut"><persName><forename type="first">Bruce</forename><surname>Reed</surname></persName><idno type="halAuthorId">131834</idno><orgName ref="#struct-365127"></orgName></author></analytic><monogr><idno type="localRef">A01-R-275 || everett01b</idno><meeting><title>Euroconference on Combinatorics, Graph Theory and Applications - COMB'01</title><date type="start">2001</date><settlement>Barcelone, Spain</settlement></meeting><imprint><biblScope unit="pp">3 p</biblScope><date type="datePub">2001</date></imprint></monogr></biblStruct></sourceDesc><profileDesc><langUsage><language ident="en">English</language></langUsage><textClass><keywords scheme="author"><term xml:lang="en">graphes parfaits</term><term xml:lang="en">bull-reducible graphs.</term><term xml:lang="en">perfect graphs</term><term xml:lang="en">star cutsets</term><term xml:lang="en">bull-free graphs</term></keywords><classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode><classCode scheme="halTypology" n="COMM">Conference papers</classCode></textClass><abstract xml:lang="en">Berge's well known SPGC (Strong Perfect Graph Conjecture) states that the class of perfect graphs coincides with the class of graphs containing no induced odd cycle of length at least 5 or the complement of such a cycle. A graph in this second class is called Berge. A bull is a graph with five vertices x, a, b, c, d and five edges xa, xb, ab, ad, bc. A graph is bull-reducible if no vertex is in two bulls. We prove that every bull-reducible Berge graph is perfect and we exhibit a polynomial-time recognition algorithm for bull-reducible Berge graphs.</abstract></profileDesc></hal></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001337 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 001337 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Hal
|étape= Corpus
|type= RBID
|clé= Hal:inria-00100577
|texte= Bull-Reducible Berge Graphs are Perfect
}}
| This area was generated with Dilib version V0.6.33. |  |