Relation of the edge sets between the competition graph and the (1,2)-step competition graph of a bipartite tournament

DOI10.3969/J.ISSN.1673-3193.2017.03.003MaRDI QIDQ3131799zbMATH OpenFDO

Authors Xiaoting An, Ruijuan Li

Publication date 29 January 2018

zbMATH Keywords

competition graphbipartite tournament\((1,2)\)-step competition graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• On \((1, 2)\)-step competition graphs of bipartite tournaments
• On \(m\)-step competition graphs of bipartite tournaments
• The independence number of the competition graph of a bipartite tournament.
• 2-Competition Graphs
• The competition graphs of oriented complete bipartite graphs

Cited in

(3)

• The (1, 2)-step competition graph of a pure local tournament that is not round decomposable
• The independence number of the competition graph of a bipartite tournament.
• On \((1, 2)\)-step competition graphs of bipartite tournaments

This page was built for publication: Relation of the edge sets between the competition graph and the \((1,2)\)-step competition graph of a bipartite tournament

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