Finding a Strong Stable Set or a Meyniel Obstruction in any Graph - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Finding a Strong Stable Set or a Meyniel Obstruction in any Graph

Abstract

A strong stable set in a graph $G$ is a stable set that contains a vertex of every maximal clique of $G$. A Meyniel obstruction is an odd circuit with at least five vertices and at most one chord. Given a graph $G$ and a vertex $v$ of $G$, we give a polytime algorithm to find either a strong stable set containing $v$ or a Meyniel obstruction in $G$. This can then be used to find in any graph, a clique and colouring of the same size or a Meyniel obstruction.
Fichier principal
Vignette du fichier
dmAE0140.pdf (97.17 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184368 , version 1 (14-08-2015)

Identifiers

Cite

Kathie Cameron, Jack Edmonds. Finding a Strong Stable Set or a Meyniel Obstruction in any Graph. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.203-206, ⟨10.46298/dmtcs.3411⟩. ⟨hal-01184368⟩

Collections

INSMI TDS-MACS
86 View
472 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More