Concordance graphs

DOI10.1006/EUJC.1999.0368MaRDI QIDQ1568783zbMATH OpenOpenAlexFDO

Authors Bernard Monjardet, Peter Fishburn

Publication date 28 August 2000

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.1999.0368

zbMATH Keywords

characterizationscomparability graphconcordance graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• Relation between the Kendall and Spearman coefficients and concordance graphs
• Simple congruence lattices of finite graphs
• On consistent families of circuits
• 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
• scientific article; zbMATH DE number 4095519

Cites work

• A Characterization of Comparability Graphs and of Interval Graphs
• Concordance between two linear orders: The Spearman and Kendall coefficients revisited
• scientific article; zbMATH DE number 3172312 (Why is no real title available?)
• Partially Ordered Sets

Cited in

(3)

• Relation between the Kendall and Spearman coefficients and concordance graphs
• Confluence number of certain derivative graphs
• scientific article; zbMATH DE number 1759454 (Why is no real title available?)

This page was built for publication: Concordance graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1568783)