Polynomial time computability of some graph parameters for superclasses of perfect graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Mathematics in Operational Research Year : 2012

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

Domains

Discrete Mathematics [cs.DM]

Arnaud Pêcher  : Connect in order to contact the contributor

https://inria.hal.science/inria-00560144

Submitted on : Thursday, January 27, 2011-2:32:23 PM

Last modification on : Thursday, April 4, 2024-3:07:57 AM

No file

Dates and versions

inria-00560144 , version 1 (27-01-2011)

Identifiers

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

PRES_CLERMONT CNRS INRIA IMB LIMOS INRIA2 TDS-MACS ANR CLERMONT-AUVERGNE-INP
110 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More