The competition number of a graph whose holes do not overlap much

DOI10.1016/J.DAM.2010.04.004zbMATH Open1209.05110OpenAlexW1968365630MaRDI QIDQ987698FDOQ987698

Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano

Publication date: 13 August 2010

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

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

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

zbMATH Keywords

competition graphcompetition numberhole

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Title not available (Why is that?)
• The competition numbers of complete tripartite graphs
• Connected triangle-free \(m\)-step competition graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Competition numbers of graphs with a small number of triangles
• Title not available (Why is that?)
• On the Computation of the Competition Number of a Graph
• The competition number of a graph with exactly \(h\) holes, all of which are independent
• The competition number of a graph having exactly one hole
• GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
• Note on the \(m\)-step competition numbers of paths and cycles
• The \(m\)-step, same-step, and any-step competition graphs
• The elimination procedure for the competition number is not optimal

Cited In (9)

• Title not available (Why is that?)
• The competition number of a graph and the dimension of its hole space
• Graphs having many holes but with small competition numbers
• The competition number of a graph having exactly one hole
• The competition numbers of ternary Hamming graphs
• Competition numbers of complete \(r\)-partite graphs
• GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
• Title not available (Why is that?)
• A sufficient condition for Kim's conjecture on 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)