scientific article
From MaRDI portal
Publication:3139771
zbMath0789.05041MaRDI QIDQ3139771
Publication date: 15 November 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Structural characterization of families of graphs (05C75) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)
Related Items (36)
On the competition graphs of \(d\)-partial orders ⋮ Competition hypergraphs ⋮ Competitively orientable complete multipartite graphs ⋮ Niche hypergraphs ⋮ A generalization of Opsut's lower bounds for the competition number of a graph ⋮ On the double competition number ⋮ On CCE graphs of doubly partial orders ⋮ On \(m\)-step competition graphs of bipartite tournaments ⋮ A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive ⋮ Edge-clique covers of the tensor product ⋮ Competition graphs of degree bounded digraphs ⋮ The \(m\)-step competition graphs of doubly partial orders ⋮ The competition number of a graph and the dimension of its hole space ⋮ Products of digraphs and their competition graphs ⋮ The competition graphs of oriented complete bipartite graphs ⋮ A complete characterization of paths that are \(m\)-step competition graphs ⋮ Structural properties and hamiltonicity of neighborhood graphs ⋮ The competition number of the complement of a cycle ⋮ On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected ⋮ The competition hypergraphs of doubly partial orders ⋮ Dimension-2 poset competition numbers and dimension-2 poset double competition numbers ⋮ A class of acyclic digraphs with interval competition graphs ⋮ Connected triangle-free \(m\)-step competition graphs ⋮ The competition numbers of ternary Hamming graphs ⋮ Characterizing paths as \(m\)-step competition graphs ⋮ Competition numbers of complete \(r\)-partite graphs ⋮ On Opsut's conjecture for hypercompetition numbers of hypergraphs ⋮ The elimination procedure for the competition number is not optimal ⋮ The competition number of a graph whose holes do not overlap much ⋮ 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 ⋮ On the radius of neighborhood graphs ⋮ The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares ⋮ The \(m\)-step competition graph of a digraph ⋮ The \(m\)-step, same-step, and any-step competition graphs ⋮ The competition number of a graph having exactly one hole
This page was built for publication:
