Skip to Main content Skip to Navigation
New interface
Journal articles

Polynomial time computability of some graph parameters for superclasses of perfect graphs

Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/inria-00560144
Contributor : Arnaud Pêcher Connect in order to contact the contributor
Submitted on : Thursday, January 27, 2011 - 2:32:23 PM
Last modification on : Saturday, June 25, 2022 - 7:47:23 PM

Identifiers

Citation

Arnaud Pêcher, Annegret K. Wagler. Polynomial time computability of some graph parameters for superclasses of perfect graphs. International Journal of Mathematics in Operational Research, 2012, 4 (3), pp.263-275. ⟨10.1504/IJMOR.2012.046687⟩. ⟨inria-00560144⟩

Share

Metrics

Record views

107