Competition graphs of transitive acyclic digraphs are strict upper bound graphs. In this paper the author characterizes those posets which can be considered transitive acyclic digraphs which have bound graphs that are interval graphs.
Recommendations
- scientific article; zbMATH DE number 1156621
- Upper bound multigraphs for posets
- 2-upper bound graphs of posets.
- scientific article; zbMATH DE number 4185661
- Upper maximal graphs of posets
- On strict semibound graphs of posets
- Publication:4484789
- On the intersection graphs associeted to posets
- scientific article; zbMATH DE number 5949787
- scientific article; zbMATH DE number 7157680
Cites work
- A Note on "The Comparability Graph of a Tree"
- scientific article; zbMATH DE number 3831999 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4033799 (Why is no real title available?)
- Representation of a finite graph by a set of intervals on the real line
- The Comparability Graph of a Tree
Cited in
(13)- Note on upper bound graphs and forbidden subposets
- Upper maximal graphs of posets
- A note on chordal bound graphs and posets
- scientific article; zbMATH DE number 3889588 (Why is no real title available?)
- On upper bound graphs with forbidden subposets
- scientific article; zbMATH DE number 4095502 (Why is no real title available?)
- A remark on signed posets and signed graphs
- scientific article; zbMATH DE number 1156621 (Why is no real title available?)
- On strict-double-bound numbers of graphs and cut sets
- On double bound graphs and forbidden subposets
- On double bound graphs and forbidden subposets
- Upper bound multigraphs for posets
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
This page was built for publication: Posets with interval upper bound graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104348)
