International audienceA 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 fundamental problem in social sciences and management is understanding and predicting decisions ma...
A fundamental problem in social sciences and management is understanding and predicting decisions ma...
A fundamental problem in social sciences and management is understanding and predicting decisions ma...
International audienceA graph is a P4-indifference graph if it admits an ordering < on its vertices ...
International audienceA graph is a P4-indifference graph if it admits an ordering < on its vertices ...
International audienceA graph is a P4-indifference graph if it admits an ordering < on its vertices ...
A graph is a P4-indifference graph if it admits an ordering < on its vertices such that every cho...
A graph is a P4-indifference graph if it admits an ordering on its vertices such that every chordles...
A simple graph is P4-indifferent if it admits a total order b > c > d. P4-indifferent graphs genera...
This paper shows how a linear time algorithm for the P 4 -indifference graphs recognition can be des...
AbstractA simple graph is P4-indifferent if it admits a total order < on its nodes such that every c...
AbstractA simple graph is P4-indifferent if it admits a total order < on its nodes such that every c...
A simple graph is P4-indifferent if it admits a total order b > c > d. P4-indifferent graphs gener...
Theme 1 - Reseaux et systemes. Projet HYPERCOMSIGLEAvailable from INIST (FR), Document Supply Servic...
AbstractThe P4-reducible graphs are a natural generalization of the well-known class of cographs, wi...
A fundamental problem in social sciences and management is understanding and predicting decisions ma...
A fundamental problem in social sciences and management is understanding and predicting decisions ma...
A fundamental problem in social sciences and management is understanding and predicting decisions ma...
International audienceA graph is a P4-indifference graph if it admits an ordering < on its vertices ...
International audienceA graph is a P4-indifference graph if it admits an ordering < on its vertices ...
International audienceA graph is a P4-indifference graph if it admits an ordering < on its vertices ...
A graph is a P4-indifference graph if it admits an ordering < on its vertices such that every cho...
A graph is a P4-indifference graph if it admits an ordering on its vertices such that every chordles...
A simple graph is P4-indifferent if it admits a total order b > c > d. P4-indifferent graphs genera...
This paper shows how a linear time algorithm for the P 4 -indifference graphs recognition can be des...
AbstractA simple graph is P4-indifferent if it admits a total order < on its nodes such that every c...
AbstractA simple graph is P4-indifferent if it admits a total order < on its nodes such that every c...
A simple graph is P4-indifferent if it admits a total order b > c > d. P4-indifferent graphs gener...
Theme 1 - Reseaux et systemes. Projet HYPERCOMSIGLEAvailable from INIST (FR), Document Supply Servic...
AbstractThe P4-reducible graphs are a natural generalization of the well-known class of cographs, wi...
A fundamental problem in social sciences and management is understanding and predicting decisions ma...
A fundamental problem in social sciences and management is understanding and predicting decisions ma...
A fundamental problem in social sciences and management is understanding and predicting decisions ma...
DOI
Add to ORKG