GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
From MaRDI portal
Publication:3367772
DOI10.4134/JKMS.2005.42.6.1251zbMath1082.05046OpenAlexW2111561282MaRDI QIDQ3367772
Publication date: 26 January 2006
Published in: Journal of the Korean Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4134/jkms.2005.42.6.1251
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (9)
A sufficient condition for Kim's conjecture on the competition numbers of graphs ⋮ The competition number of a graph and the dimension of its hole space ⋮ The competition number of a graph with exactly two holes ⋮ Graphs having many holes but with small competition numbers ⋮ An upper bound for the competition numbers of graphs ⋮ The competition number of a graph whose holes do not overlap much ⋮ Fuzzy k-Competition Graphs and p-Competition Fuzzy Graphs ⋮ The competition number of a graph with exactly \(h\) holes, all of which are independent ⋮ \(m\)-step fuzzy competition graphs
This page was built for publication: GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
