Linear time recognition of P4-indifference graphs

Michel Habib 1 Christophe Paul 2 Laurent Viennot 3
2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
3 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : A graph is a P4-indifference graph if it admits an ordering < on its vertices such that every chordless path with vertices a, b, c, d and edges ab, bc, cd has a
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/inria-00471619
Contributor : Laurent Viennot <>
Submitted on : Thursday, April 8, 2010 - 4:13:43 PM
Last modification on : Thursday, February 7, 2019 - 4:57:01 PM
Long-term archiving on : Friday, July 9, 2010 - 9:18:36 PM

Files

dmtcs2001.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00471619, version 1

Citation

Michel Habib, Christophe Paul, Laurent Viennot. Linear time recognition of P4-indifference graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2001, 4 (2), pp.173-178. ⟨inria-00471619⟩

Share

Metrics

Record views

538

Files downloads

426