Linear time recognition of P4-indifference graphs
Discrete mathematics & theoretical computer science, Tome 4 (2000-2001) no. 2
Cet article a éte moissonné depuis la source Episciences
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
@article{DMTCS_2001_4_2_a2,
author = {Habib, Michel and Paul, Christophe and Viennot, Laurent},
title = {Linear time recognition of {P4-indifference} graphs},
journal = {Discrete mathematics & theoretical computer science},
year = {2000-2001},
volume = {4},
number = {2},
doi = {10.46298/dmtcs.269},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.269/}
}
TY - JOUR AU - Habib, Michel AU - Paul, Christophe AU - Viennot, Laurent TI - Linear time recognition of P4-indifference graphs JO - Discrete mathematics & theoretical computer science PY - 2000-2001 VL - 4 IS - 2 UR - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.269/ DO - 10.46298/dmtcs.269 LA - en ID - DMTCS_2001_4_2_a2 ER -
%0 Journal Article %A Habib, Michel %A Paul, Christophe %A Viennot, Laurent %T Linear time recognition of P4-indifference graphs %J Discrete mathematics & theoretical computer science %D 2000-2001 %V 4 %N 2 %U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.269/ %R 10.46298/dmtcs.269 %G en %F DMTCS_2001_4_2_a2
Habib, Michel; Paul, Christophe; Viennot, Laurent. Linear time recognition of P4-indifference graphs. Discrete mathematics & theoretical computer science, Tome 4 (2000-2001) no. 2. doi: 10.46298/dmtcs.269
Cité par Sources :