A sufficient condition for Kim's conjecture on the competition numbers of graphs

DOI10.1016/J.DISC.2011.11.035zbMATH Open1238.05106OpenAlexW1975902904WikidataQ123258876 ScholiaQ123258876MaRDI QIDQ409447FDOQ409447

Authors: Akira Kamibeppu 

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

Recommendations

• An upper bound for the competition numbers of graphs
• The competition number of a graph whose holes do not overlap much
• Graphs having many holes but with small competition numbers
• Competition numbers, quasi-line graphs, and holes
• The competition number of a graph and the dimension of its hole space

zbMATH Keywords

competition graphcompetition numberhole

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• An upper bound for the competition numbers of graphs
• 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
• The competition number of a graph whose holes do not overlap much

Cited In (4)

• On the phylogeny graphs of degree-bounded digraphs
• On \((1, 2)\)-step competition graphs of bipartite tournaments
• A generalization of Opsut's lower bounds for the competition number of a graph
• An upper bound for the competition numbers of graphs

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)