Weakly transitive orientations, Hasse diagrams and string graphs
DOI10.1016/0012-365X(93)90176-TzbMATH Open0782.05070MaRDI QIDQ686503FDOQ686503
Authors: Matthias Middendorf, Frank Pfeiffer 
Publication date: 20 December 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 3939387
- String graphs and incomparability graphs
- String graphs and incomparability graphs
- Transitive Orientations of Graphs
- On weakly half-transitive graphs
- On transitive orientations with restricted covering graphs
- Weakly Hadamard diagonalizable graphs
- Strongly 2-connected orientations of graphs
- On the Structure of the Strong Orientations of a Graph
- Semi-transitive orientations and word-representable graphs
complexityintersection graphsinterval graphscharacterizationcircular-arc graphsNP-completeNP-hardnessplanar graphsrecognition problempermutation graphscomparability graphsHasse diagramscircular-permutation graphsstring graphsweakly transitive orientable graphsweakly transitive orientation
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Cites Work
Cited In (8)
- String graphs. I: The number of critical nonstring graphs is infinite
- Title not available (Why is that?)
- Order-Preserving 1-String Representations of Planar Graphs
- Hasse diagrams with large chromatic number
- Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree
- Outerstring Graphs are $\chi$-Bounded
- Coloring Hasse diagrams and disjointness graphs of curves
- Computing maximum independent set on outerstring graphs and their relatives
This page was built for publication: Weakly transitive orientations, Hasse diagrams and string graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686503)
