Interval competition graphs of symmetric digraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3889550 (Why is no real title available?)
- scientific article; zbMATH DE number 3853101 (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 15260 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- scientific article; zbMATH DE number 3307331 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- Representation of a finite graph by a set of intervals on the real line
- Space graphs and sphericity
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Cited in
(11)- Chromatic numbers of competition graphs
- A characterization of graphs with interval two-step graphs
- scientific article; zbMATH DE number 140094 (Why is no real title available?)
- Characterization of digraphs with equal domination graphs and underlying graphs
- The \(m\)-step competition graphs of doubly partial orders
- On CCE graphs of doubly partial orders
- The competition hypergraphs of doubly partial orders
- scientific article; zbMATH DE number 7217245 (Why is no real title available?)
- Two-step graphs of trees
- A class of acyclic digraphs with interval competition graphs
- Structural properties and hamiltonicity of neighborhood graphs
This page was built for publication: Interval competition graphs of symmetric digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688262)