Digraphs whose m-step competition graphs have triangles

DOI10.1016/J.DAM.2025.10.033MaRDI QIDQ6885543zbMATH OpenFDO

Authors Yan Long, Bo Deng

Publication date 11 December 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.10.033

zbMATH Keywords

triangledigraphs\(m\)-step competition graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites work

• A characterization of competition graphs
• A complete characterization of paths that are m-step competition graphs
• Competition graphs of degree bounded digraphs
• Competition numbers and phylogeny numbers of connected graphs and hypergraphs
• Connected triangle-free \(m\)-step competition graphs
• Digraphs whose \(m\)-step competition graphs are trees
• Note on the m-step competition numbers of paths and cycles
• The (1, 2)-step competition graph of a pure local tournament that is not round decomposable
• The \(m\)-step competition graph of a digraph
• The niche graphs of bipartite tournaments

This page was built for publication: Digraphs whose \(m\)-step competition graphs have triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885543)