GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE

DOI10.4134/JKMS.2005.42.6.1251MaRDI QIDQ3367772zbMATH OpenOpenAlexFDO

Authors Suh-Ryung Kim

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

zbMATH Keywords

acyclic digraphchordal graphchordless cyclecycle

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• The competition number of a graph having exactly one hole
• Graphs having many holes but with small competition numbers
• The competition number of a graph with exactly two holes
• The competition number of a graph with exactly two holes.
• The competition number of a graph whose holes do not overlap much
• Competition numbers, quasi-line graphs, and holes
• The competition number of a graph and the dimension of its hole space
• The competition number of a graph with exactly \(h\) holes, all of which are independent
• Holes in graphs
• Graphs with at most one crossing

Cited in

(10)

• The competition number of a graph with exactly \(h\) holes, all of which are independent
• m-step fuzzy competition graphs
• The competition number of a graph having exactly one hole
• 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
• Fuzzy \(k\)-competition graphs and \(p\)-competition fuzzy graphs
• 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

This page was built for publication: GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3367772)