Characterizing paths as \(m\)-step competition graphs

DOI10.1016/J.DISC.2010.06.009zbMath1206.05059OpenAlexW2050665246MaRDI QIDQ708427

Brandon Christopher Swan, Jaromy Scott Kuhl

Publication date: 11 October 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.06.009

zbMATH Keywords

digraphpathwalkm-step competition

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

A generalization of Opsut's result on the competition numbers of line graphs

Cites Work

• Unnamed Item
• The competition numbers of complete tripartite graphs
• Note on the \(m\)-step competition numbers of paths and cycles
• The competition number of a graph with exactly \(h\) holes, all of which are independent
• Competition numbers of graphs with a small number of triangles
• The \(m\)-step competition graph of a digraph
• Connected triangle-free \(m\)-step competition graphs
• The \(m\)-step, same-step, and any-step competition graphs

This page was built for publication: Characterizing paths as \(m\)-step competition graphs