The competition number of a graph whose holes do not overlap much
From MaRDI portal
(Redirected from Publication:987698)
Recommendations
- Spinning Brownian motion
- Stationary distributions for diffusions with inert drift
- Reflected Brownian motion in the quarter plane: an equivalence based on time reversal
- The stationary distribution of reflected Brownian motion in a planar region
- Multidimensional reflected Brownian motions having exponential stationary distributions
Cites work
- scientific article; zbMATH DE number 434915 (Why is no real title available?)
- scientific article; zbMATH DE number 3912431 (Why is no real title available?)
- scientific article; zbMATH DE number 3706451 (Why is no real title available?)
- scientific article; zbMATH DE number 3606214 (Why is no real title available?)
- Competition numbers of graphs with a small number of triangles
- Connected triangle-free \(m\)-step competition graphs
- GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
- Graph theory
- Note on the m-step competition numbers of paths and cycles
- On the Computation of the Competition Number of a Graph
- The \(m\)-step, same-step, and any-step competition graphs
- The competition number of a graph having exactly one hole
- The competition number of a graph with exactly \(h\) holes, all of which are independent
- The competition numbers of complete tripartite graphs
- The elimination procedure for the competition number is not optimal
Cited in
(17)- scientific article; zbMATH DE number 165080 (Why is no real title available?)
- The competition number of a graph and the dimension of its hole space
- The competition number of a graph with exactly two holes
- The competition number of a graph with exactly \(h\) holes, all of which are independent
- Graphs having many holes but with small competition numbers
- Stationary distributions for diffusions with inert drift
- The competition number of a graph with exactly two holes.
- The competition number of a graph having exactly one hole
- The competition numbers of ternary Hamming graphs
- Competition numbers of complete \(r\)-partite graphs
- Spinning Brownian motion
- GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
- scientific article; zbMATH DE number 4142069 (Why is no real title available?)
- A sufficient condition for Kim's conjecture on the competition numbers of graphs
- Competition numbers, quasi-line graphs, and holes
- Stationary distributions and convergence for Walsh diffusions
- An upper bound for the competition numbers of graphs
This page was built for publication: The competition number of a graph whose holes do not overlap much
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987698)