{"docId":232,"paperId":232,"url":"https:\/\/dmtcs.episciences.org\/232","doi":"10.46298\/dmtcs.232","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":68,"name":"Vol. 1"}],"section":[],"repositoryName":"Hal","repositoryIdentifier":"hal-00955688","repositoryVersion":1,"repositoryLink":"https:\/\/hal.science\/hal-00955688v1","dateSubmitted":"2015-03-26 16:16:56","dateAccepted":"2015-06-09 14:44:52","datePublished":"1997-01-01 08:00:00","titles":{"en":"On P_4-tidy graphs"},"authors":["Giakoumakis, V.","Roussel, F.","Thuillier, H."],"abstracts":{"en":"We study the P_4-tidy graphs, a new class defined by Rusu [30] in order to illustrate the notion of P_4-domination in perfect graphs. This class strictly contains the P_4-extendible graphs and the P_4-lite graphs defined by Jamison & Olariu in [19] and [23] and we show that the P_4-tidy graphs and P_4-lite graphs are closely related. Note that the class of P_4-lite graphs is a class of brittle graphs strictly containing the P_4-sparse graphs defined by Hoang in [14]. McConnel & Spinrad [2] and independently Cournier & Habib [5] have shown that the modular decomposition tree of any graph is computable in linear time. For recognizing in linear time P_4-tidy graphs, we apply a method introduced by Giakoumakis in [9] and Giakoumakis & Fouquet in [6] using modular decomposition of graphs and we propose linear algorithms for optimization problems on such graphs, as clique number, stability number, chromatic number and scattering number. We show that the Hamiltonian Path Problem is linear for this class of graphs. Our study unifies and generalizes previous results of Jamison & Olariu ([18], [21], [22]), Hochstattler & Schindler[16], Jung [25] and Hochstattler & Tinhofer [15]."},"keywords":[["graph modular decomposition"],["perfection P_4-structure"],"[INFO.INFO-DM] Computer Science [cs]\/Discrete Mathematics [cs.DM]"]}