A cleanup on transitive orientation

DOI10.1007/BFB0019427MaRDI QIDQ4525261zbMATH OpenFDO

Authors Klaus Simon, P. Trunz

Publication date 21 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0019427

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1003286
• Modular decomposition and transitive orientation
• Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
• On Comparability and Permutation Graphs
• On transitive orientations with restricted covering graphs

Cited in

(13)

• Cycle-free partial orders and chordal comparability graphs
• On the \(P_4\)-components of graphs
• A translation of Gallai's paper: `Transitiv orientierbare Graphen'
• scientific article; zbMATH DE number 1003286 (Why is no real title available?)
• Characterizations of treelike comparability graphs
• An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time
• scientific article; zbMATH DE number 637327 (Why is no real title available?)
• scientific article; zbMATH DE number 1508917 (Why is no real title available?)
• Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
• To reorient is easier than to orient: An on-line algorithm for reorientation of graphs
• Comparability digraphs: an analogue of comparability graphs
• Partitioned probe comparability graphs
• An implicit representation of chordal comparability graphs in linear time

This page was built for publication: A cleanup on transitive orientation

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