scientific article; zbMATH DE number 434480

MaRDI QIDQ3139271zbMATH OpenFDO

Authors Terry A. McKee, F. R. McMorris

Publication date 11 November 1993

zbMATH Keywords

characterizationcomparability graphcomparability multigraphspermutation multigraphsposet

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Combinatorics of partially ordered sets (06A07)

Recommendations

• Upper bound multigraphs for posets
• scientific article; zbMATH DE number 3914376
• scientific article; zbMATH DE number 568805
• scientific article; zbMATH DE number 15868
• Reconstruction of posets with the same comparability graph

Cited in

(12)

• Comparability graphs with constraint, partial semi-orders and interval orders
• Reconstruction of posets with the same comparability graph
• Finite orders which are reconstructible up to duality by their comparability graphs
• Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
• scientific article; zbMATH DE number 4214075 (Why is no real title available?)
• Characterizations of treelike comparability graphs
• On Comparability and Permutation Graphs
• scientific article; zbMATH DE number 3914376 (Why is no real title available?)
• scientific article; zbMATH DE number 3995740 (Why is no real title available?)
• scientific article; zbMATH DE number 3893249 (Why is no real title available?)
• Sources in posets and comparability graphs
• Almost all comparability graphs are UPO

This page was built for publication:

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