A class of acyclic digraphs with interval competition graphs
From MaRDI portal
Publication:2486750
Recommendations
Cites work
- scientific article; zbMATH DE number 434915 (Why is no real title available?)
- scientific article; zbMATH DE number 4149959 (Why is no real title available?)
- scientific article; zbMATH DE number 3912431 (Why is no real title available?)
- scientific article; zbMATH DE number 3606214 (Why is no real title available?)
- scientific article; zbMATH DE number 1303533 (Why is no real title available?)
- scientific article; zbMATH DE number 1145906 (Why is no real title available?)
- scientific article; zbMATH DE number 2188417 (Why is no real title available?)
- A characterization of competition graphs
- A characterization of competition graphs of arbitrary digraphs
- Competition Graphs of Hamiltonian Digraphs
- Competition Graphs of Strongly Connected and Hamiltonian Digraphs
- Interval competition graphs of symmetric digraphs
- Interval digraphs: An analogue of interval graphs
- Two-step graphs of trees
- \((i,j)\) competition graphs
Cited in
(9)- On the partial order competition dimensions of chordal graphs
- On the competition graphs of \(d\)-partial orders
- A graph with the partial order competition dimension greater than five
- On CCE graphs of doubly partial orders
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- The \(m\)-step competition graphs of doubly partial orders
- The competition hypergraphs of doubly partial orders
- The partial order competition dimensions of bipartite graphs
- scientific article; zbMATH DE number 5914965 (Why is no real title available?)
This page was built for publication: A class of acyclic digraphs with interval competition graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486750)