Skip to Main content Skip to Navigation
New interface
Journal articles

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 metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Laurent Viennot Connect in order to contact the contributor
Submitted on : Thursday, April 8, 2010 - 4:13:43 PM
Last modification on : Tuesday, October 25, 2022 - 4:20:09 PM
Long-term archiving on: : Friday, July 9, 2010 - 9:18:36 PM


Files produced by the author(s)



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



Record views


Files downloads