A characterization of competition graphs of arbitrary digraphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3853101 (Why is no real title available?)
- scientific article; zbMATH DE number 3737705 (Why is no real title available?)
- scientific article; zbMATH DE number 3582190 (Why is no real title available?)
- scientific article; zbMATH DE number 3606214 (Why is no real title available?)
- scientific article; zbMATH DE number 3307331 (Why is no real title available?)
- A characterization of competition graphs
- A characterization of graphs of competition number m
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- On the Computation of the Competition Number of a Graph
Cited in
(18)- Competition polysemy
- Competition hypergraphs
- Competition graphs of degree bounded digraphs
- A characterization of graphs of competition number m
- Niche graphs
- A characterization of competition graphs
- Competition numbers of graphs with a small number of triangles
- Applications of edge coverings by cliques
- \((i,j)\) competition graphs
- Characterizations of competition multigraphs
- A generalization of Opsut's lower bounds for the competition number of a graph
- Phylogeny numbers
- \(p\)-competition graphs
- Two-\(\phi\)-tolerance competition graphs
- Loop and cyclic niche graphs
- Tolerance competition graphs
- A class of acyclic digraphs with interval competition graphs
- The competition-common enemy graph of a digraph
This page was built for publication: A characterization of competition graphs of arbitrary digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1055445)
