Competition graphs of degree bounded digraphs
From MaRDI portal
Publication:6180650
DOI10.1016/j.dam.2023.10.009zbMath1530.05062arXiv2307.11625OpenAlexW4387853473MaRDI QIDQ6180650
Publication date: 2 January 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2307.11625
Structural characterization of families of graphs (05C75) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of competition graphs
- A characterization of graphs of competition number m
- A characterization of competition graphs of arbitrary digraphs
- \((i,j)\) competition graphs
- The \(m\)-step competition graph of a digraph
- On chordal phylogeny graphs
- On the phylogeny graphs of degree-bounded digraphs
- On the Computation of the Competition Number of a Graph
- Digraphs whose \(m\)-step competition graphs are trees
This page was built for publication: Competition graphs of degree bounded digraphs