The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable

DOI10.1016/j.dam.2015.12.013zbMath1333.05138OpenAlexW2299226832MaRDI QIDQ266961

Xin-Hong Zhang, Rui Juan Li

Publication date: 7 April 2016

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

Full work available at URL: https://doi.org/10.1016/j.dam.2015.12.013

zbMATH Keywords

competition graph\((1, 2)\)-step competition graphlocal tournamentlocally semicomplete digraphround-decomposable

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable ⋮ Unnamed Item ⋮ On \((1, 2)\)-step competition graphs of bipartite tournaments ⋮ On the phylogeny graphs of degree-bounded digraphs ⋮ The niche graphs of bipartite tournaments ⋮ The Hamiltonicity on the competition graphs of round digraphs ⋮ Digraphs whose \(m\)-step competition graphs are trees ⋮ The partial order competition dimensions of bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable
• The (1,2)-step competition graph of a tournament
• The competition numbers of complete tripartite graphs
• A characterization of competition graphs
• A classification of locally semicomplete digraphs
• Connected triangle-free \(m\)-step competition graphs
• Locally semicomplete digraphs: A generalization of tournaments
• Connectivity properties of locally semicomplete digraphs
• Competition Graphs of Hamiltonian Digraphs

This page was built for publication: The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable