Sur les graphes admettant le nombre maximum de sous-graphes à trois sommets et deux arêtes, et les paires d'ordres totaux qui maximisent \(| Rho\)- Tau\(|\). (On the graphs which admit the maximal number of subgraphs on three vertices and with two edges
From MaRDI portal
Publication:757415
DOI10.1016/S0195-6698(88)80054-4zbMath0723.05072MaRDI QIDQ757415
Claude Le Conte de Poly-Barbut
Publication date: 1988
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Related Items (2)
Concordance between two linear orders: The Spearman and Kendall coefficients revisited ⋮ On the comparison of the Spearman and Kendall metrics between linear orders.
Cites Work
This page was built for publication: Sur les graphes admettant le nombre maximum de sous-graphes à trois sommets et deux arêtes, et les paires d'ordres totaux qui maximisent \(| Rho\)- Tau\(|\). (On the graphs which admit the maximal number of subgraphs on three vertices and with two edges
