A sufficient condition for Kim's conjecture on the competition numbers of graphs
From MaRDI portal
Publication:409447
DOI10.1016/J.DISC.2011.11.035zbMATH Open1238.05106OpenAlexW1975902904WikidataQ123258876 ScholiaQ123258876MaRDI QIDQ409447
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.11.035
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- An upper bound for the competition numbers of graphs
- The competition number of a graph whose holes do not overlap much
- 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
Related Items (3)
A generalization of Opsut's lower bounds for the competition number of a graph ⋮ On \((1, 2)\)-step competition graphs of bipartite tournaments ⋮ On the phylogeny graphs of degree-bounded digraphs
This page was built for publication: A sufficient condition for Kim's conjecture on the competition numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409447)
