Extending partial suborders

MaRDI QIDQ2816022zbMATH OpenFDO

Authors Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich

Publication date 1 July 2016

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065305800733?np=y

zbMATH Keywords

comparability graphtransitive orientation

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Combinatorics of partially ordered sets (06A07)

Recommendations

• On transitive orientations with restricted covering graphs
• scientific article; zbMATH DE number 4027523
• scientific article; zbMATH DE number 3908482
• Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
• Minimal comparability completions of arbitrary graphs

Cited in

(5)

• Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems
• A class of special subordinators with nested ranges
• Effective extensions of partial orders
• Finding the largest suborder of fixed width
• More on the order of prolongations and restrictions

This page was built for publication: Extending partial suborders

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