scientific article; zbMATH DE number 1554932
From MaRDI portal
Publication:4525261
zbMATH Open0953.05506MaRDI QIDQ4525261FDOQ4525261
Authors: Klaus Simon, P. Trunz
Publication date: 21 January 2001
Title of this publication is not available (Why is that?)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)
Cited In (10)
- An implicit representation of chordal comparability graphs in linear time
- Partitioned probe comparability graphs
- Comparability digraphs: an analogue of comparability graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A translation of Gallai's paper: `Transitiv orientierbare Graphen'
- An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time
- Characterizations of treelike comparability graphs
- On the \(P_4\)-components of graphs
- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
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 Q4525261)